20 search results - page 3 / 4 » Computing minimum distance between two implicit algebraic su... |
WG
2010
Springer
13 years 4 months ago
2010
Springer
Θk-graphs are geometric graphs that appear in the context of graph navigation. The shortest-path metric of these graphs is known to approximate the Euclidean complete graph up to...
EUROGRAPHICS
2010
Eurographics
14 years 3 months ago
2010
Eurographics
Blending is both the strength and the weakness of functionally based implicit surfaces (such as F-reps or softobjects). While it gives them the unique ability to smoothly merge in...
SMA
2006
ACM
14 years 5 days ago
2006
ACM
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...
CA
2000
IEEE
13 years 10 months ago
2000
IEEE
We present a very general geometrical correction method for enforcing collisions and other geometrical constraints between polygonal mesh surfaces. It is based on a global resolut...
NIPS
2001
13 years 7 months ago
2001
Guided by an initial idea of building a complex (non linear) decision surface with maximal local margin in input space, we give a possible geometrical intuition as to why K-Neares...