Sciweavers

219 search results - page 37 / 44
» Subdivision surface watermarking
Sort
View
PG
2003
IEEE
15 years 7 months ago
A State Machine for Real-Time Cutting of Tetrahedral Meshes
We introduce an algorithm that consistently and accurately processes arbitrary intersections in tetrahedral meshes in real-time. The intersection surfaces are modeled up to the cu...
Daniel Bielser, Pascal Glardon, Matthias Teschner,...
117
Voted
EJC
2010
15 years 1 months ago
On the infinitesimal rigidity of weakly convex polyhedra
The main motivation here is a question: whether any polyhedron which can be subdivided into convex pieces without adding a vertex, and which has the same vertices as a convex poly...
Robert Connelly, Jean-Marc Schlenker
APGV
2007
ACM
115views Visualization» more  APGV 2007»
15 years 5 months ago
A roughness measure for 3D mesh visual masking
3D models are subject to a wide variety of processing operations such as compression, simplification or watermarking, which introduce slight geometric modifications on the shape. ...
Guillaume Lavoué
103
Voted
GRAPHICSINTERFACE
2007
15 years 3 months ago
Constrained planar remeshing for architecture
Material limitations and fabrication costs generally run at odds with the creativity of architectural design, producing a wealth of challenging computational geometry problems. We...
Barbara Cutler, Emily Whiting
COMPGEOM
2006
ACM
15 years 7 months ago
An optimal-time algorithm for shortest paths on a convex polytope in three dimensions
We present an optimal-time algorithm for computing (an implicit representation of) the shortest-path map from a fixed source s on the surface of a convex polytope P in three dime...
Yevgeny Schreiber, Micha Sharir