Sciweavers

839 search results - page 77 / 168
» Three-Clustering of Points in the Plane
Sort
View
JDA
2010
95views more  JDA 2010»
13 years 8 months ago
Sigma-local graphs
We introduce and analyze σ-local graphs, based on a definition of locality by Erickson [12]. We present two algorithms to construct such graphs, for any real number σ > 1 an...
Prosenjit Bose, Sébastien Collette, Stefan ...
DAM
2011
13 years 5 months ago
Untangling planar graphs from a specified vertex position - Hard cases
Given a planar graph G, we consider drawings of G in the plane where edges are represented by straight line segments (which possibly intersect). Such a drawing is specified by an ...
Mihyun Kang, Oleg Pikhurko, Alexander Ravsky, Math...
ICCV
2009
IEEE
15 years 3 months ago
Globally Optimal Affine Epipolar Geometry from Apparent Contours
We study the problem of estimating the epipolar geometry from apparent contours of smooth curved surfaces with affine camera models. Since apparent contours are viewpoint depend...
Gang Li, Yanghai Tsin
ICIP
2000
IEEE
14 years 12 months ago
3-D Reconstruction of Real-World Objects Using Extended Voxels
In this paper we present a voxel-based 3-D reconstruction technique that computes a set of non-transparent object surface voxels from a given set of calibrated camera views. We sh...
Eckehard G. Steinbach, Bernd Girod, Peter Eisert, ...
ISAAC
2009
Springer
98views Algorithms» more  ISAAC 2009»
14 years 4 months ago
New Bounds on the Average Distance from the Fermat-Weber Center of a Planar Convex Body
The Fermat-Weber center of a planar body Q is a point in the plane from which the average distance to the points in Q is minimal. We first show that for any convex body Q in the ...
Adrian Dumitrescu, Csaba D. Tóth