Sciweavers

14850 search results - page 140 / 2970
» A Geometric Approach to Betweenness
Sort
View
ACSC
2003
IEEE
14 years 3 months ago
Path-Planning by Tessellation of Obstacles
We describe two algorithms for static path-planning, with the aim of deriving the trajectory that always maximises the distance of the path from the nearest obstacle. The bubble a...
Tane Pendragon, R. Lyndon While
DAGM
2003
Springer
14 years 3 months ago
Shape Preservation during Digitization: Tight Bounds Based on the Morphing Distance
We define strong r-similarity and the morphing distance to bound geometric distortions between shapes of equal topology. We then derive a necessary and sufficient condition for a ...
Peer Stelldinger, Ullrich Köthe
ECCV
1992
Springer
14 years 2 months ago
Critical Sets for 3D Reconstruction Using Lines
This paper describes the geometrical limitations of algorithms for 3D reconstruction which use corresponding line tokens. In addition to announcing a description of the general cri...
Thomas Buchanan
CCCG
2009
13 years 11 months ago
Relaxed Gabriel Graphs
We study a new family of geometric graphs that interpolate between the Delaunay triangulation and the Gabriel graph. These graphs share many properties with skeletons for [0, 1]...
Prosenjit Bose, Jean Cardinal, Sébastien Co...
DM
2010
126views more  DM 2010»
13 years 10 months ago
Asymptotic connectivity of hyperbolic planar graphs
We investigate further the concept of asymptotic connectivity as defined previously by the first author. In particular, we compute an upper bound on the asymptotic connectivity of ...
Patrick Bahls, Michael R. Dipasquale