83 search results - page 4 / 17 » Enumeration of Regular Triangulations |
ISAAC
1999
Springer
13 years 11 months ago
1999
Springer
We consider online routing algorithms for routing between the vertices of embedded planar straight line graphs. Our results include (1) two deterministic memoryless routing algorit...
COMPGEOM
2003
ACM
14 years 19 days ago
2003
ACM
I discuss algorithms based on bistellar flips for inserting and deleting constraining (d − 1)-facets in d-dimensional constrained Delaunay triangulations (CDTs) and weighted CD...
DCC
2010
IEEE
13 years 7 months ago
2010
IEEE
In this paper we develop general techniques for enumerating orthogonal Buekenhout unitals embedded in two-dimensional translation planes. We then apply these techniques in the reg...
CVPR
2000
IEEE
14 years 9 months ago
2000
IEEE
Image-based-interpolation creates smooth and photorealistic views between two view points. The concept of joint view triangulation (JVT) has been proven to be an efficient multi-v...
ASPDAC
2001
ACM
13 years 11 months ago
2001
ACM
Given n points in a plane, a minimum spanning tree is a set of edges which connects all the points and has a minimum total length. A naive approach enumerates edges on all pairs o...