Sciweavers

Share
CCCG
2010
9 years 4 months ago
Compatible pointed pseudo-triangulations
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...
Thomas Hackl, Oswin Aichholzer, Birgit Vogtenhuber
COMPGEOM
2008
ACM
9 years 4 months ago
Extremal problems on triangle areas in two and three dimensions
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, ...
Adrian Dumitrescu, Micha Sharir, Csaba D. Tó...
SGP
2007
9 years 5 months ago
Surface reconstruction using local shape priors
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 ...
Ran Gal, Ariel Shamir, Tal Hassner, Mark Pauly, Da...
ICCV
1995
IEEE
9 years 6 months ago
Locating Objects Using the Hausdorff Distance
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...
William Rucklidge
COMPGEOM
1995
ACM
9 years 6 months ago
Triangulations Intersect Nicely
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...
Oswin Aichholzer, Franz Aurenhammer, Michael Tasch...
CW
2004
IEEE
9 years 6 months ago
Interactive Point-Based Painterly Rendering
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...
Hiroaki Kawata, Alexandre Gouaillard, Takashi Kana...
3DPVT
2004
IEEE
107views Visualization» more  3DPVT 2004»
9 years 6 months ago
An Easy Viewer for Out-of-Core Visualization of Huge Point-Sampled Models
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...
Fang Meng, Hongbin Zha
DAC
1989
ACM
9 years 6 months ago
A New Approach to the Rectilinear Steiner Tree Problem
: 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 ...
Jan-Ming Ho, Gopalakrishnan Vijayan, C. K. Wong
COMPGEOM
1996
ACM
9 years 6 months ago
Flipping Edges in Triangulations
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...
Ferran Hurtado, Marc Noy, Jorge Urrutia
GD
2009
Springer
9 years 7 months ago
Drawing Hamiltonian Cycles with No Large Angles
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...
Adrian Dumitrescu, János Pach, Géza ...
books