1245 search results - page 28 / 249 » Triangulation for Points on Lines |
IJCGA
2002
14 years 9 months ago
2002
This paper presents how the space of spheres and shelling may be used to delete a point from a d-dimensional triangulation efficiently. In dimension two, if k is the degree of the...
169
click to vote
APDC
1997
14 years 11 months ago
1997
Delaunaytriangulationhas beenmuchusedin suchapplicationsas volumerendering, shape representation, terrain modeling and so on. The main disadvantage of Delaunay triangulationis lar...
85
Voted
CCCG
2010
14 years 11 months ago
2010
In this paper we show how to construct in 2 rounds a line-rigid point placement graph of size 4n/3+O(1) from small graphs called 6:6 jewels, an extension of the 4:4 jewel of [3]. ...
98
Voted
BIRTHDAY
2010
Springer
14 years 10 months ago
2010
Springer
The question of whether there is a logic that captures polynomial time was formulated by Yuri Gurevich in 1988. It is still wide open and regarded as one of the main open problems...
CVPR
2006
IEEE
15 years 11 months ago
2006
IEEE
In this paper we propose a practical and efficient method for finding the globally optimal solution to the problem of pose estimation of a known object. We present a framework tha...