Sciweavers

133 search results - page 13 / 27
» On the distinct distances determined by a planar point set
Sort
View
CORR
2008
Springer
95views Education» more  CORR 2008»
14 years 11 months ago
The Plane-Width of Graphs
Map vertices of a graph to (not necessarily distinct) points of the plane so that two adjacent vertices are mapped at least a unit distance apart. The plane-width of a graph is th...
Marcin Kaminski, Paul Medvedev, Martin Milanic
132
Voted
ECCV
2010
Springer
14 years 9 months ago
Articulation-Invariant Representation of Non-planar Shapes
Given a set of points corresponding to a 2D projection of a non-planar shape, we would like to obtain a representation invariant to articulations (under no self-occlusions). It is ...
Raghuraman Gopalan, Pavan K. Turaga, Rama Chellapp...
SODA
2007
ACM
123views Algorithms» more  SODA 2007»
15 years 1 months ago
Region-fault tolerant geometric spanners
We introduce the concept of region-fault tolerant spanners for planar point sets, and prove the existence of region-fault tolerant spanners of small size. For a geometric graph G ...
Mohammad Ali Abam, Mark de Berg, Mohammad Farshi, ...
CGF
2005
232views more  CGF 2005»
14 years 11 months ago
Algorithms for Interactive Editing of Level Set Models
Level set models combine a low-level volumetric representation, the mathematics of deformable implicit surfaces, and powerful, robust numerical techniques to produce a novel appro...
Ken Museth, David E. Breen, Ross T. Whitaker, Sean...
92
Voted
ICRA
2002
IEEE
104views Robotics» more  ICRA 2002»
15 years 4 months ago
A Visual Landmark Framework for Indoor Mobile Robot Navigation
This article presents vision functions needed on a mobile robot to deal with landmark-based navigation in buildings. Landmarks are planar, quadrangular surfaces, which must be dis...
Jean-Bernard Hayet, Frédéric Lerasle...