92 search results - page 13 / 19 » The Number of Triangulations on Planar Point Sets |
IVC
2000
13 years 8 months ago
2000
Feature matching is a prerequisite to a wide variety of vision tasks. This paper presents a method that addresses the problem of matching disparate views of coplanar points and li...
IPL
2006
13 years 8 months ago
2006
Let TS be the set of all crossing-free straight line spanning trees of a planar n-point set S. Consider the graph TS where two members T and T of TS are adjacent if T intersects T...
COMPGEOM
2010
ACM
14 years 1 months ago
2010
ACM
The best known upper bound on the number of topological changes in the Delaunay triangulation of a set of moving points in R2 is (nearly) cubic, even if each point is moving with ...
3DGIS
2006
Springer
14 years 2 months ago
2006
Springer
The modelling or reconstruction of buildings has two aspects – on the one hand we need a data structure and the associated geometric information, and on the other hand we need a...
CGF
2006
13 years 8 months ago
2006
Spline curves are useful in a variety of geometric modeling and graphics applications and covering problems abound in practical settings. This work defines a class of covering dec...