Sciweavers

121 search results - page 1 / 25
» A bound on the number of points of a plane curve
Sort
View
COMGEO
2004
ACM
13 years 5 months ago
A lower bound on the number of triangulations of planar point sets
We show that the number of straight-edge triangulations exhibited by any set of n points in general position in the plane is bounded from below by (2.33n). 2004 Elsevier B.V. All ...
Oswin Aichholzer, Ferran Hurtado, Marc Noy
GD
2005
Springer
13 years 10 months ago
Odd Crossing Number Is Not Crossing Number
The crossing number of a graph is the minimum number of edge intersections in a plane drawing of a graph, where each intersection is counted separately. If instead we count the nu...
Michael J. Pelsmajer, Marcus Schaefer, Daniel Stef...
COMPGEOM
2004
ACM
13 years 10 months ago
Solution of Scott's problem on the number of directions determined by a point set in 3-space
Let P be a set of n points in Ê3 , not all in a common plane. We solve a problem of Scott (1970) by showing that the connecting lines of P assume at least 2n − 7 different dir...
János Pach, Rom Pinchasi, Micha Sharir
GD
2007
Springer
13 years 11 months ago
Algorithms for Multi-criteria One-Sided Boundary Labeling
We present new algorithms for labeling a set P of n points in the plane with labels that are aligned to the left of the bounding box of P. The points are connected to their labels ...
Marc Benkert, Herman J. Haverkort, Moritz Kroll, M...