Sciweavers

1879 search results - page 260 / 376
» Computational geometry algorithms library
Sort
View
3DPVT
2006
IEEE
215views Visualization» more  3DPVT 2006»
15 years 10 months ago
Region-Based Motion Analysis and 3D Reconstruction for a Translational Video Sequence
This paper presents a hybrid 1D motion estimation algorithm which combines pixel-based and region-based approaches that can give depth images from translational video sequences wi...
Xiaodong Huang, Eric Dubois
134
Voted
COMPGEOM
2009
ACM
15 years 9 months ago
k-means requires exponentially many iterations even in the plane
The k-means algorithm is a well-known method for partitioning n points that lie in the d-dimensional space into k clusters. Its main features are simplicity and speed in practice....
Andrea Vattani
DAGSTUHL
2008
15 years 6 months ago
Uniprocessor EDF Feasibility is an Integer Problem
The research on real-time scheduling has mostly focused on the development of algorithms that allows to test whether the constraints imposed on the task execution (often expressed ...
Enrico Bini
CCCG
1993
15 years 6 months ago
Widest-corridor Problems
A k-dense corridor through a finite set, S, of n points in the plane is the open region of the plane that is bounded by two parallel lines that intersect the convex hull of S and ...
Ravi Janardan, Franco P. Preparata
CORR
2010
Springer
83views Education» more  CORR 2010»
15 years 3 months ago
Multitriangulations, pseudotriangulations and primitive sorting networks
We study the set of all pseudoline arrangements with contact points which cover a given support. We define a notion of flip which transforms a pseudoline arrangement with contact...
Vincent Pilaud, Michel Pocchiola