Sciweavers

313 search results - page 20 / 63
» Algorithms on negatively curved spaces
Sort
View
CAD
2006
Springer
13 years 10 months ago
Trimming local and global self-intersections in offset curves/surfaces using distance maps
A robust and efficient algorithm for trimming both local and global self-intersections in offset curves and surfaces is presented. Our scheme is based on the derivation of a ratio...
Joon-Kyung Seong, Gershon Elber, Myung-Soo Kim
IJCV
2006
116views more  IJCV 2006»
13 years 10 months ago
Contextual Inference in Contour-Based Stereo Correspondence
Standard approaches to stereo correspondence have difficulty when scene structure does not lie in or near the frontal parallel plane, in part because an orientation disparity as we...
Gang Li, Steven W. Zucker
SIGGRAPH
1993
ACM
14 years 2 months ago
Interval methods for multi-point collisions between time-dependent curved surfaces
We present an efficient and robust algorithm for finding points of collision between time-dependent parametric and implicit surfaces. The algorithm detects simultaneous collisio...
John M. Snyder, Adam R. Woodbury, Kurt W. Fleische...
TALG
2008
86views more  TALG 2008»
13 years 9 months ago
Embeddings of negative-type metrics and an improved approximation to generalized sparsest cut
In this paper, we study the metrics of negative type, which are metrics (V, d) such that d is an Euclidean metric; these metrics are thus also known as " 2-squared" met...
Shuchi Chawla, Anupam Gupta, Harald Räcke
VIS
2003
IEEE
145views Visualization» more  VIS 2003»
14 years 11 months ago
Signed Distance Transform Using Graphics Hardware
This paper presents a signed distance transform algorithm using graphics hardware, which computes the scalar valued function of the Euclidean distance to a given manifold of co-di...
Christian Sigg, Markus H. Gross, Ronald Peikert