121 search results - page 2 / 25 » A bound on the number of points of a plane curve |
COMBINATORICS
1998
13 years 5 months ago
1998
An n-Venn diagram is a collection of n finitely-intersecting simple closed curves in the plane, such that each of the 2n sets X1 ∩X2 ∩· · ·∩Xn, where each Xi is the open...
CORR
2011
Springer
13 years 1 months ago
2011
Springer
Given a graph G, an obstacle representation of G is a set of points in the plane representing the vertices of G, together with a set of connected obstacles such that two vertices ...
CORR
2010
Springer
13 years 6 months ago
2010
Springer
Given an n-vertex graph G, a drawing of G in the plane is a mapping of its vertices into points of the plane, and its edges into continuous curves, connecting the images of their ...
CORR
2010
Springer
13 years 3 months ago
2010
Springer
We generalize the notions of flippable and simultaneously-flippable edges in a triangulation of a set S of points in the plane, into so called pseudo simultaneously-flippable edge...
COMPGEOM
2009
ACM
14 years 21 days ago
2009
ACM
We show that the number of unit-area triangles determined by a set of n points in the plane is O(n9/4+ε), for any ε > 0, improving the recent bound O(n44/19) of Dumitrescu et...