Sciweavers

727 search results - page 17 / 146
» One line and n points
Sort
View
STACS
2007
Springer
15 years 4 months ago
Light Orthogonal Networks with Constant Geometric Dilation
An orthogonal spanner network for a given set of n points in the plane is a plane straight line graph with axis-aligned edges that connects all input points. We show that for any ...
Adrian Dumitrescu, Csaba D. Tóth
FSTTCS
2006
Springer
15 years 1 months ago
Coresets for Discrete Integration and Clustering
Given a set P of n points on the real line and a (potentially innite) family of functions, we investigate the problem of nding a small (weighted) subset S P, such that for any f ...
Sariel Har-Peled
CORR
2008
Springer
77views Education» more  CORR 2008»
14 years 10 months ago
Principal Graphs and Manifolds
In many physical statistical, biological and other investigations it is desirable to approximate a system of points by objects of lower dimension and/or complexity. For this purpo...
Alexander N. Gorban, Andrei Yu. Zinovyev
CCCG
1993
14 years 11 months ago
Maintaining the Approximate Width of a Set of Points in the Plane
d abstract) Gunter Rotey Christian Schwarzz Jack Snoeyinkx The width of a set of n points in the plane is the smallest distance between two parallel lines that enclose the set. W...
Günter Rote, Christian Schwarz, Jack Snoeyink
CORR
1999
Springer
84views Education» more  CORR 1999»
14 years 9 months ago
Finding an ordinary conic and an ordinary hyperplane
Given a finite set of non-collinear points in the plane, there exists a line that passes through exactly two points. Such a line is called an ordinary line. An efficient algorithm...
Olivier Devillers, Asish Mukhopadhyay