Sciweavers

79 search results - page 14 / 16
» Planarity of iterated line graphs
Sort
View
SODA
2008
ACM
93views Algorithms» more  SODA 2008»
13 years 10 months ago
Minimum weight convex Steiner partitions
New tight bounds are presented on the minimum length of planar straight line graphs connecting n given points in the plane and having convex faces. Specifically, we show that the ...
Adrian Dumitrescu, Csaba D. Tóth
SGP
2007
13 years 11 months ago
Triangulations with locally optimal Steiner points
We present two new Delaunay refinement algorithms, second an extension of the first. For a given input domain (a set of points or a planar straight line graph), and a threshold an...
Hale Erten, Alper Üngör
SCIA
2009
Springer
261views Image Analysis» more  SCIA 2009»
14 years 1 months ago
Dense and Deformable Motion Segmentation for Wide Baseline Images
In this paper we describe a dense motion segmentation method for wide baseline image pairs. Unlike many previous methods our approach is able to deal with deforming motions and lar...
Juho Kannala, Esa Rahtu, Sami S. Brandt, Janne Hei...
APPROX
2006
Springer
120views Algorithms» more  APPROX 2006»
14 years 8 days ago
Single-Source Stochastic Routing
Abstract. We introduce and study the following model for routing uncertain demands through a network. We are given a capacitated multicommodity flow network with a single source an...
Shuchi Chawla, Tim Roughgarden
CVPR
2010
IEEE
13 years 9 months ago
Player Localization Using Multiple Static Cameras for Sports Visualization
We present a novel approach for robust localization of multiple people observed using multiple cameras. We use this location information to generate sports visualizations, which i...
Raffay Hamid, Ramkrishan Kumar, Matthias Grundmann...