235 search results - page 22 / 47 » On joint triangulations of two sets of points in the plane |
COMPGEOM
2010
ACM
13 years 12 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 ...
ECCV
2004
Springer
14 years 8 months ago
2004
Springer
Abstract. In this paper, a new camera calibration algorithm is proposed, which is from the quasi-affine invariance of two parallel circles. Two parallel circles here mean two circl...
DCG
2007
13 years 6 months ago
2007
Steinitz’s Theorem states that a graph is the 1-skeleton of a convex polyhedron if and only if it is 3-connected and planar. The polyhedron is called a geometric realization of ...
IPL
2008
13 years 6 months ago
2008
Let S be a set of n points in general position in the plane, labelled bijectively with the integers {0, 1, . . ., n - 1}. Each edge (the straight segment that joins two points) is...
INFOCOM
2005
IEEE
14 years 11 days ago
2005
IEEE
— In this paper we investigate network design for a wireless service provider using two orthogonal technologies: a WAN technology with uniform spatial coverage and set of LAN acc...