9 search results - page 1 / 2 » A spectral characterization of the Delaunay triangulation |
CAGD
2010
13 years 7 months ago
2010
FSTTCS
2007
Springer
14 years 1 months ago
2007
Springer
Given a set S of line segments in the plane, we introduce a new family of partitions of the convex hull of S called segment triangulations of S. The set of faces of such a triangul...
DCG
2008
13 years 7 months ago
2008
Two-dimensional constrained Delaunay triangulations are geometric structures that are popular for interpolation and mesh generation because they respect the shapes of planar domai...
SGP
2004
13 years 9 months ago
2004
: We introduce a noise-resistant algorithm for reconstructing a watertight surface from point cloud data. It forms a Delaunay tetrahedralization, then uses a variant of spectral gr...
ISCAS
2008
IEEE
14 years 1 months ago
2008
IEEE
— This paper presents a robust watermarking method for curves that uses informed-detection. To embed watermarks, the presented algorithm parameterizes a curve using the B-spline ...