91 search results - page 11 / 19 » Triangulating a Plane |
120
Voted
SODA
2008
ACM
15 years 3 months ago
2008
ACM
Greedy Routing is a class of routing algorithms in which the packets are forwarded in a manner that reduces the distance to the destination at every step. In an attempt to provide...
133
click to vote
SGP
2003
15 years 3 months ago
2003
3D scanners, iso-surface extraction procedures, and several recent geometric compression schemes sample surfaces of 3D shapes in a regular fashion, without any attempt to align th...
125
click to vote
COMGEO
2010
ACM
15 years 1 months ago
2010
ACM
: We present a method to compute the exact topology of a real algebraic surface S, implicitly given by a polynomial f Q[x,y,z] of arbitrary total degree N. Additionally, our analy...
109
click to vote
COMPGEOM
2010
ACM
15 years 7 months ago
2010
ACM
We study the expected number of interior vertices of degree i in a triangulation of a point set S, drawn uniformly at random from the set of all triangulations of S, and derive va...
101
Voted
CCCG
2010
15 years 3 months ago
2010
For a given point set S (in general position), two pointed pseudo-triangulations are compatible if their union is plane. We show that for any set S there exist two maximally disjo...