123 search results - page 2 / 25 » Enumerating Triangulation Paths |
ISAAC
1999
Springer
13 years 9 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...
DM
2010
13 years 5 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 ...
DMTCS
2010
13 years 2 months ago
2010
We find the asymptotic number of 2-orientations of quadrangulations with n inner faces, and of 3orientations of triangulations with n inner vertices. We also find the asymptotic n...
COMPGEOM
1991
ACM
13 years 8 months ago
1991
ACM
We describe methods for triangulating polygonal regions of the plane so that no triangle has a large angle. Our main result is that a polygon with n sides can be triangulated with...
DAC
1995
ACM
13 years 9 months ago
1995
ACM
—Embedded computer systems are characterized by the presence of a processor running application-specific dedicated software. A large number of these systems must satisfy real-ti...