Computational geometry: an introduction
Computational geometry: an introduction
Algorithms in combinatorial geometry
Algorithms in combinatorial geometry
Shape reconstruction from planar cross sections
Computer Vision, Graphics, and Image Processing
On optimal interpolation triangle incidences
SIAM Journal on Scientific and Statistical Computing
Introduction to algorithms
Randomized incremental construction of Delaunay and Voronoi diagrams
Proceedings of the seventeenth international colloquium on Automata, languages and programming
Minimal roughness property of the Delaunay triangulation
Computer Aided Geometric Design
Polynomial-size nonobtuse triangulation of polygons
SCG '91 Proceedings of the seventh annual symposium on Computational geometry
Optimality of the Delaunay triangulation in Rd
SCG '91 Proceedings of the seventh annual symposium on Computational geometry
Primitives for the manipulation of general subdivisions and the computation of Voronoi
ACM Transactions on Graphics (TOG)
Triangulating polygons without large angles
SCG '92 Proceedings of the eighth annual symposium on Computational geometry
Hierarchical triangulation for multiresolution surface description
ACM Transactions on Graphics (TOG)
Reconstruction of geological structures from heterogeneous and sparse data
GIS '96 Proceedings of the 4th ACM international workshop on Advances in geographic information systems
Area-preserving piecewise affine mappings
SCG '01 Proceedings of the seventeenth annual symposium on Computational geometry
Shape reconstruction from unorganized cross-sections
SGP '07 Proceedings of the fifth Eurographics symposium on Geometry processing
Accelerating ray tracing using constrained tetrahedralizations
EGSR'08 Proceedings of the Nineteenth Eurographics conference on Rendering
| Hi-index | 0.00 |
A plane geometric graph C in R2 conforms to another such graph G if each edge of G is the union of some edges of C. It is proved that for every G with n vertices and m edges, there is a completion of a Delaunay triangulation of O(m2n) points that conforms to G. The algorithm that constructs the points is also described.