CCCG
2010
13 years 6 months ago
2010
For a given point set S (in general position), two pointed pseudo-triangulations are compatible if their union is plane. We show that for any set S there exist two maximally disjo...
COMPGEOM
2008
ACM
13 years 6 months ago
2008
ACM
The study of extremal problems on triangle areas was initiated in a series of papers by Erdos and Purdy in the early 1970s. In this paper we present new results on such problems, ...
SGP
2007
13 years 6 months ago
2007
We present an example-based surface reconstruction method for scanned point sets. Our approach uses a database of local shape priors built from a set of given context models that ...
ICCV
1995
IEEE
13 years 8 months ago
1995
IEEE
The Hausdorff distance is a measure defined between two point sets, here representing a model and an image. The Hausdorff distance is reliable even when the image contains multipl...
COMPGEOM
1995
ACM
13 years 8 months ago
1995
ACM
Abstract. We show that there is a matching between the edges of any two triangulations of a planar point set such that an edge of one triangulation is matched either to the identic...
CW
2004
IEEE
13 years 8 months ago
2004
IEEE
Non-photo realistic rendering (NPR) methods have been proposed for more than ten years in the Computer Graphic field. Separately, within past few years, several algorithms for ren...
3DPVT
2004
IEEE
13 years 8 months ago
2004
IEEE
In this paper, we propose a viewer for huge point-sampled models by combining out-of-core technologies with view-dependent level-of-detail (LOD) control. This viewer is designed o...
DAC
1989
ACM
13 years 8 months ago
1989
ACM
: We discuss a new approach to constructing the rectilinear Steiner tree (RST) of a given set of points in the plane, starting from a minimum spanning tree (MST). The main idea in ...
COMPGEOM
1996
ACM
13 years 8 months ago
1996
ACM
A triangulation of a point set Pn is a partitioning of the convex hull Conv(Pn) into a set of triangles with disjoint interiors such that the vertices of these triangles are in Pn...
GD
2009
Springer
13 years 9 months ago
2009
Springer
Let n ≥ 4 be even. It is shown that every set S of n points in the plane can be connected by a (possibly self-intersecting) spanning tour (Hamiltonian cycle) consisting of n str...