215 search results - page 31 / 43 » Farthest-Polygon Voronoi Diagrams |
COMPGEOM
1997
ACM
13 years 11 months ago
1997
ACM
Abstract. In the context of methodologies intended to confer robustness to geometric algorithms, we elaborate on the exact-computation paradigm and formalize the notion of degree o...
ESA
2006
Springer
13 years 11 months ago
2006
Springer
Lower envelopes are fundamental structures in computational geometry, which have many applications, such as computing general Voronoi diagrams and performing hidden surface removal...
COMPGEOM
2001
ACM
13 years 11 months ago
2001
ACM
: Many geometric problems like generalized Voronoi diagrams, medial axis computations and boundary evaluation involve computation and manipulation of non-linear algebraic primitive...
CGI
2000
IEEE
13 years 11 months ago
2000
IEEE
This paper gives an overview of some recent methods useful for local and global shape analysis and for the design of solids. These methods include as new tools for global and loca...
SMA
1995
ACM
13 years 11 months ago
1995
ACM
This paper presents a new computational method for fully automated triangular mesh generation, consistently applicable to wire-frame, surface, solid, and nonmanifold geometries. T...