Sciweavers

160 search results - page 19 / 32
» Focal surfaces of discrete geometry
Sort
View
COMPGEOM
1995
ACM
13 years 11 months ago
A New Technique for Analyzing Substructures in Arrangements
We present a simple but powerful new probabilistic technique for analyzing the combinatorial complexity of various substructures in arrangements of piecewise-linear surfaces in hig...
Boaz Tagansky
CVRMED
1997
Springer
13 years 11 months ago
Medical image segmentation using topologically adaptable surfaces
E cient and powerful topologically adaptable deformable surfaces can be created by embedding and de ning discrete deformable surface models in terms of an A ne Cell Decomposition (...
Tim McInerney, Demetri Terzopoulos
SMI
2010
IEEE
173views Image Analysis» more  SMI 2010»
13 years 6 months ago
Point Cloud Skeletons via Laplacian Based Contraction
—We present an algorithm for curve skeleton extraction via Laplacian-based contraction. Our algorithm can be applied to surfaces with boundaries, polygon soups, and point clouds....
Junjie Cao, Andrea Tagliasacchi, Matt Olson, Hao Z...
COMPGEOM
2010
ACM
14 years 19 days ago
Output-sensitive algorithm for the edge-width of an embedded graph
Let G be an unweighted graph of complexity n cellularly embedded in a surface (orientable or not) of genus g. We describe improved algorithms to compute (the length of) a shortest...
Sergio Cabello, Éric Colin de Verdiè...
DGCI
2006
Springer
13 years 11 months ago
Improving Difference Operators by Local Feature Detection
Differential operators are required to compute several characteristics for continuous surfaces, as e.g. tangents, curvature, flatness, shape descriptors. We propose to replace diff...
Kristof Teelen, Peter Veelaert