Sciweavers

94 search results - page 11 / 19
» Visibility Graphs of Point Sets in the Plane
Sort
View
GD
2006
Springer
13 years 11 months ago
Computing Geometric Minimum-Dilation Graphs Is NP-Hard
We prove that computing a geometric minimum-dilation graph on a given set of points in the plane, using not more than a given number of edges, is an NP-hard problem, no matter if ...
Rolf Klein, Martin Kutz
DMTCS
2010
157views Mathematics» more  DMTCS 2010»
13 years 4 months ago
Edge-Removal and Non-Crossing Configurations in Geometric Graphs
A geometric graph is a graph G = (V, E) drawn in the plane, such that V is a point set in general position and E is a set of straight-line segments whose endpoints belong to V . W...
Oswin Aichholzer, Sergio Cabello, Ruy Fabila Monro...
3DPVT
2006
IEEE
231views Visualization» more  3DPVT 2006»
13 years 11 months ago
Simplified Belief Propagation for Multiple View Reconstruction
We address multiple-view reconstruction under an optimization approach based on belief propagation. A novel formulation of belief propagation that operates in 3-D is proposed to f...
E. Scott Larsen, Philippos Mordohai, Marc Pollefey...
NIPS
2003
13 years 8 months ago
An Improved Scheme for Detection and Labelling in Johansson Displays
Consider a number of moving points, where each point is attached to a joint of the human body and projected onto an image plane. Johannson showed that humans can effortlessly det...
Claudio Fanti, Marzia Polito, Pietro Perona
CORR
2010
Springer
168views Education» more  CORR 2010»
13 years 4 months ago
Bounds on the maximum multiplicity of some common geometric graphs
We obtain new lower and upper bounds for the maximum multiplicity of some weighted and, respectively, non-weighted common geometric graphs drawn on n points in the plane in genera...
Adrian Dumitrescu, André Schulz, Adam Sheff...