91 search results - page 14 / 19 » Triangulating a Plane |
COMPGEOM
2011
ACM
13 years 2 months ago
2011
ACM
We present three results related to dynamic convex hulls: • A fully dynamic data structure for maintaining a set of n points in the plane so that we can find the edges of the c...
ICPR
2000
IEEE
14 years 3 months ago
2000
IEEE
This paper presents a new method for the incremental integration of overlapped range images. It is assumed thatframe transformations between all pairs of views can be reliably com...
CPC
2007
13 years 11 months ago
2007
Let P(G,t) and F(G,t) denote the chromatic and flow polynomials of a graph G. G.D. Birkhoff and D.C. Lewis showed that, if G is a plane near triangulation, then the only zeros of...
IFIP
1998
Springer
14 years 3 months ago
1998
Springer
A conservative implementation of a predicate returns true only if the exact predicate is true. That is, we accept a one sided error for the implementation. For geometric predicate...
WACV
2005
IEEE
14 years 4 months ago
2005
IEEE
We propose a novel method of robustly and automatically creating surface meshes from the very sparsely populated 3D point clouds typically produced by Structure from Motion algori...