Sciweavers

732 search results - page 89 / 147
» Surface And Deep Cases
Sort
View
COMPGEOM
2006
ACM
14 years 2 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
SMA
2006
ACM
101views Solid Modeling» more  SMA 2006»
14 years 2 months ago
A higher dimensional formulation for robust and interactive distance queries
We present an efficient and robust algorithm for computing the minimum distance between a point and freeform curve or surface by lifting the problem into a higher dimension. This...
Joon-Kyung Seong, David E. Johnson, Elaine Cohen
SIGGRAPH
1997
ACM
13 years 11 months ago
View-dependent refinement of progressive meshes
Level-of-detail (LOD) representations are an important tool for realtime rendering of complex geometric environments. The previously introduced progressive mesh representation def...
Hugues Hoppe
BILDMED
2007
112views Algorithms» more  BILDMED 2007»
13 years 9 months ago
Fully-Automatic Correction of the Erroneous Border Areas of an Aneurysm
Abstract. Volume representations of blood vessels acquired by 3D rotational angiography are very suitable for diagnosing an aneurysm. We presented a fully-automatic aneurysm labell...
Jan Bruijns, Frans J. Peters, Robert-Paul Berretty...
CORR
2011
Springer
220views Education» more  CORR 2011»
13 years 3 months ago
On a linear programming approach to the discrete Willmore boundary value problem and generalizations
We consider the problem of finding (possibly non connected) discrete surfaces spanning a finite set of discrete boundary curves in the three-dimensional space and minimizing (glo...
Thomas Schoenemann, Simon Masnou, Daniel Cremers