44 search results - page 3 / 9 » Triangulation of Points, Lines and Conics |
COCOON
2003
Springer
15 years 5 months ago
2003
Springer
In this paper, we show some properties of a pseudotriangle and present three combinatorial bounds: the ratio of the size of minimum pseudotriangulation of a point set S and the siz...
COMPGEOM
2004
ACM
15 years 5 months ago
2004
ACM
This paper presents an algorithm for sampling and triangulating a generic C2 -smooth surface Σ ⊂ R3 that is input with an implicit equation. The output triangulation is guarant...
122
click to vote
SGP
2007
15 years 2 months ago
2007
We present two new Delaunay refinement algorithms, second an extension of the first. For a given input domain (a set of points or a planar straight line graph), and a threshold an...
CVPR
2001
IEEE
16 years 1 months ago
2001
IEEE
In this paper we present a new algorithm for structure from motion from point correspondences in images taken from uncalibrated catadioptric cameras with parabolic mirrors. We ass...
163
click to vote
COMPGEOM
2011
ACM
14 years 3 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...