Constrained Texture Mapping via Approximate Voronoi Base Domain
Abstract
References
Index Terms
- Constrained Texture Mapping via Approximate Voronoi Base Domain
Recommendations
Efficient computation of 3d clipped voronoi diagram
GMP'10: Proceedings of the 6th international conference on Advances in Geometric Modeling and ProcessingThe Voronoi diagram is a fundamental geometry structure widely used in various fields, especially in computer graphics and geometry computing. For a set of points in a compact 3D domain (i.e. a finite 3D volume), some Voronoi cells of their Voronoi ...
Constrained delaunay triangulations
AbstractGiven a set ofn vertices in the plane together with a set of noncrossing, straight-line edges, theconstrained Delaunay triangulation (CDT) is the triangulation of the vertices with the following properties: (1) the prespecified edges are included ...
Voronoi-Delaunay duality and Delaunay meshes
SPM '07: Proceedings of the 2007 ACM symposium on Solid and physical modelingWe define a Delaunay mesh to be a manifold triangle mesh whose edges form an intrinsic Delaunay triangulation or iDT of its vertices, where the triangulated domain is the piecewise flat mesh surface. We show that meshes constructed from a smooth surface ...
Comments
Information & Contributors
Information
Published In

Publisher
Association for Computing Machinery
New York, NY, United States
Publication History
Check for updates
Author Tags
Qualifiers
- Research-article
- Research
- Refereed limited
Conference
Acceptance Rates
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 113Total Downloads
- Downloads (Last 12 months)9
- Downloads (Last 6 weeks)2
Other Metrics
Citations
View Options
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in