83 search results - page 9 / 17 » Acute Triangulations of Polygons |
CGF
2004
13 years 7 months ago
2004
We present a novel clustering algorithm for polygonal meshes which approximates a Centroidal Voronoi Diagram construction. The clustering provides an efficient way to construct un...
JCT
2007
13 years 7 months ago
2007
A k-triangulation of a convex polygon is a maximal set of diagonals so that no k + 1 of them mutually cross in their interiors. We present a bijection between 2-triangulations of a...
GRAPHICSINTERFACE
2000
13 years 9 months ago
2000
As modeling and visualization applications proliferate, there arises a need to simplify large polygonal models at interactive rates. Unfortunately existing polygon mesh simplifica...
SI3D
2003
ACM
14 years 28 days ago
2003
ACM
This paper describes a framework for introducing visually smooth surfaces into sketch-based freeform modeling systems. An existing sketch-based freeform modeling system generates ...
SGP
2004
13 years 10 months ago
2004
We present a method for parameterizing irregularly triangulated input models over polyhedral domains with quadrilateral faces. A combination of center-based clustering techniques ...