150 search results - page 18 / 30 » Flipping Edges in Triangulations |
CCCG
2010
13 years 9 months ago
2010
Three types of geometric structure--grid triangulations, rectangular subdivisions, and orthogonal polyhedra-can each be described combinatorially by a regular labeling: an assignm...
DM
2010
13 years 7 months ago
2010
We compute the generating function for triangulations on a cylinder, with the restriction that all vertices belong to its boundary and that the intersection of a pair of different ...
COMPGEOM
2010
ACM
14 years 20 days ago
2010
ACM
The best known upper bound on the number of topological changes in the Delaunay triangulation of a set of moving points in R2 is (nearly) cubic, even if each point is moving with ...
SMA
2008
ACM
13 years 7 months ago
2008
ACM
In this paper we present a new algorithm which turns an unstructured triangle mesh into a quad-dominant mesh with edges aligned to the principal directions of the underlying geome...
CVPR
2005
IEEE
14 years 9 months ago
2005
IEEE
This paper advocates an implicit-surface representation of generic 3?D surfaces to take advantage of occluding edges in a very robust way. This lets us exploit silhouette constrai...