Bibiliopgraphy
@InCollection(Aristides.A.G.Requicha 1980,
author=
{Aristides.A.G.Requicha},
year=
{1980},
keywords= {CAD/CAM,computational
geometry,computer graphics,
design and manufacturing automation,geometric -
-modeling,representation of solids},
institution= {College of Engg and Applied
science,The University of
Rochester,New York-14627},
title=
{ Representations of Rigid Solids:Theory,Methods &
Systems},
booktitle=
{Computing Surveys},
month=
{ december},
volume=
{12},
annote=
{
Computer based systems for modeling the geometry of rigid solid
objects are becoming increasingly important in mechanical and civil
engineering ,architecture and other areas.The variety and uses of systems
embodying representations of solids are growing rapidly ,but so are the
difficuilties in assesing the current designs ,specifying the characteristics
that future systems should exhibit ,and designing systems to meet such
specifications.The first part introduces a simple mathematical frame
workfor characterising certain important aspects of representations.
The second part uses the frame work to describe and compare all of the
major
known schemes for representing solids.The third part briefly surveys extant
geometric modeling systems and then applies the concepts developed in the
paper to the high level design of a multiple representation geometric
modeling
system which exhibits a level of reliability and versatality superior
to
that of systems currently used in industrial Computer-Aided-Design and
manufacturing.}
@incollection (Avraham
Margalit and Gary D.Knott1989,
author=
{Avraham Margalit,Gary.D.Knott},
year=
{1989},
keywords=
{Polygons,intersecting,manifold,domain,dangling edges},
institution=
{Computer Vision Laboratory,Center for Automation reasearch,University
of Maryland,
College Park,MD 20742 and
Dept of Computer science University of Maryland.},
title=
{An algorithm for Computing the Union intersection or differnce of two
polygons},
booktitle=
{Computer and Graphics},
month=
{april},
volume=
{13},
pages=
{167-183},
annote=
{The algorithm uses a boundary representation for the input and output
polygons.Its domain includes simple polygons as well as polygons with dangling
edges,vertices of degree greater than 2,and holes with in the area of the
polygon.It is facilitated by the use of efficient data structures.
- parthasarathy}
Back to contents