1672 search results - page 122 / 335 » Tightness problems in the plane |
COMPGEOM
2004
ACM
15 years 4 months ago
2004
ACM
Given a set P of n points in convex position in the plane, we prove that there exists a point p ∈ P such that the number of distinct distances from p is at least (13n−6)/36 . ...
MFCS
2004
Springer
15 years 4 months ago
2004
Springer
We study the on-line versions of two fundamental graph problems, maximum independent set and minimum coloring, for the case of disk graphs which are graphs resulting from intersect...
94
Voted
GREC
2003
Springer
15 years 4 months ago
2003
Springer
We aim to reconstruct three-dimensional polyhedral solids from axonometric-like line drawings. A new approach is proposed to make use of planes of mirror symmetry detected in such ...
COMPGEOM
2010
ACM
15 years 4 months ago
2010
ACM
We prove that the union complexity of a set of n constantcomplexity locally fat objects (which can be curved and/or non-convex) in the plane is O(λt+2(n) log n), where t is the m...
COMPGEOM
2010
ACM
15 years 4 months ago
2010
ACM
We characterize the set of all pairs (a, b) such that for every set P of n points in general position in R2 there always exists a point p ∈ P and two opposite quadrants determin...