Sciweavers

121 search results - page 19 / 25
» A bound on the number of points of a plane curve
Sort
View
WG
2010
Springer
13 years 5 months ago
Connections between Theta-Graphs, Delaunay Triangulations, and Orthogonal Surfaces
Θk-graphs are geometric graphs that appear in the context of graph navigation. The shortest-path metric of these graphs is known to approximate the Euclidean complete graph up to...
Nicolas Bonichon, Cyril Gavoille, Nicolas Hanusse,...
SODA
1992
ACM
109views Algorithms» more  SODA 1992»
13 years 8 months ago
New Algorithms for Minimum Area k-gons
Given a set P of n points in the plane, we wish to find a set Q P of k points for which the convex hull conv(Q) has the minimum area. We solve this, and the related problem of fi...
David Eppstein
CIVR
2005
Springer
169views Image Analysis» more  CIVR 2005»
14 years 27 days ago
An Invariant Representation for Matching Trajectories Across Uncalibrated Video Streams
Abstract. We introduce a view–point invariant representation of moving object trajectories that can be used in video database applications. It is assumed that trajectories lie on...
Walter Nunziati, Stan Sclaroff, Alberto Del Bimbo
CORR
2011
Springer
197views Education» more  CORR 2011»
13 years 2 months ago
Arrangements of double pseudolines
We define a double pseudoline as a simple closed curve in the open M¨obius band homotopic to the double of its core circle, and we define an arrangement of double pseudolines a...
Luc Habert, Michel Pocchiola
SODA
2010
ACM
238views Algorithms» more  SODA 2010»
14 years 4 months ago
How good is the Chord algorithm?
The Chord algorithm is a popular, simple method for the succinct approximation of curves, which is widely used, under different names, in a variety of areas, such as, multiobjecti...
Constantinos Daskalakis, Ilias Diakonikolas, Mihal...