5210 search results - page 143 / 1042 » Exact geometric computation |
CORR
2008
Springer
14 years 10 months ago
2008
Springer
We provide linear-time algorithms for geometric graphs with sublinearly many crossings. That is, we provide algorithms running in O(n) time on connected geometric graphs having n ...
CAD
2004
Springer
14 years 10 months ago
2004
Springer
Boundary representation models reconstructed from 3D range data suffer from various inaccuracies caused by noise in the data and the model building software. Such models can be im...
PAMI
2008
14 years 8 months ago
2008
Abstract-- This paper proposes a deterministic observer design for visual tracking based on non-parametric implicit (level-set) curve descriptions. The observer is continuous-discr...
COMSIS
2010
14 years 7 months ago
2010
We propose a new method for matching two 3D point sets of identical cardinality with global similarity but local non-rigid deformations and distribution errors. This problem arises...
116
click to vote
COMGEO
2011
ACM
14 years 5 months ago
2011
ACM
Let P be a set of n points in the plane. A geometric proximity graph on P is a graph where two points are connected by a straight-line segment if they satisfy some prescribed prox...