Sciweavers

160 search results - page 10 / 32
» Focal surfaces of discrete geometry
Sort
View
105
Voted
COMPGEOM
2000
ACM
15 years 6 months ago
Fast software for box intersections
We present fast implementations of a hybrid algorithm for reporting box and cube intersections. Our algorithm initially takes a divide-and-conquer approach and switches to simpler...
Afra Zomorodian, Herbert Edelsbrunner
DGCI
1999
Springer
15 years 6 months ago
A Topological Method of Surface Representation
A new method of representing a surface in the 3D space as a single digitally continuous sequence of faces is described. The method is based on topological properties of quasi-manif...
Vladimir Kovalevsky
106
Voted
COMPUTING
2007
126views more  COMPUTING 2007»
15 years 1 months ago
An algorithm for the construction of intrinsic delaunay triangulations with applications to digital geometry processing
The discrete Laplace-Beltrami operator plays a prominent role in many Digital Geometry Processing applications ranging from denoising to parameterization, editing, and physical si...
Matthew Fisher, Boris Springborn, Peter Schrö...
121
Voted
IMR
2004
Springer
15 years 7 months ago
Two Techniques to Improve Mesh Quality and Preserve Surface Characteristics
In this paper we present two novel techniques to improve the quality of triangle surface meshes while preserving surface characteristics as much as possible. In contrast to previo...
Irina B. Semenova, Vladimir V. Savchenko, Ichiro H...
COMPGEOM
2003
ACM
15 years 7 months ago
Restricted delaunay triangulations and normal cycle
We address the problem of curvature estimation from sampled smooth surfaces. Building upon the theory of normal cycles, we derive a definition of the curvature tensor for polyhed...
David Cohen-Steiner, Jean-Marie Morvan