Sciweavers

2188 search results - page 155 / 438
» Instance-Optimal Geometric Algorithms
Sort
View
SMI
2005
IEEE
117views Image Analysis» more  SMI 2005»
15 years 10 months ago
Contouring 1- and 2-Manifolds in Arbitrary Dimensions
We propose an algorithm for contouring k-manifolds (k = 1, 2) embedded in an arbitrary n-dimensional space. We assume (n−k) geometric constraints are represented as polynomial e...
Joon-Kyung Seong, Gershon Elber, Myung-Soo Kim
CAD
2006
Springer
15 years 4 months ago
Constrained 3D shape reconstruction using a combination of surface fitting and registration
We investigate 3D shape reconstruction from measurement data in the presence of constraints. The constraints may fix the surface type or set geometric relations between parts of a...
Yang Liu, Helmut Pottmann, Wenping Wang
EWC
2006
61views more  EWC 2006»
15 years 4 months ago
Embarrassingly parallel mesh refinement by edge subdivision
We have previously proposed a new technique for the communication-free adaptive refinement of tetrahedral meshes that works for all configurations. Implementations of the scheme mu...
David C. Thompson, Philippe P. Pébay
SIAMIS
2008
115views more  SIAMIS 2008»
15 years 4 months ago
Geodesic Evolution Laws---A Level-Set Approach
Motion of curves governed by geometric evolution laws, such as mean curvature flow and surface diffusion, is the basis for many algorithms in image processing. If the images to be ...
Christina Stöcker, Axel Voigt
JMMA
2002
90views more  JMMA 2002»
15 years 4 months ago
Implicit Convex Polygons
Convex polygons in the plane can be defined explicitly as an ordered list of vertices, or given implicitly, for example by a list of linear constraints. The latter representation h...
Francisco Gómez, Ferran Hurtado, Suneeta Ra...