Sciweavers

839 search results - page 31 / 168
» Three-Clustering of Points in the Plane
Sort
View
CCCG
2007
13 years 10 months ago
The Ordinary Line Problem Revisited
Let P be a set of n points in the plane. A connecting line of P is a line that passes through at least two of its points. A connecting line is called ordinary if it is incident on...
Asish Mukhopadhyay, Eugene Greene
CORR
2010
Springer
168views Education» more  CORR 2010»
13 years 6 months ago
Bounds on the maximum multiplicity of some common geometric graphs
We obtain new lower and upper bounds for the maximum multiplicity of some weighted and, respectively, non-weighted common geometric graphs drawn on n points in the plane in genera...
Adrian Dumitrescu, André Schulz, Adam Sheff...
LATIN
2010
Springer
14 years 3 months ago
Visiting a Sequence of Points with a Bevel-Tip Needle
Abstract. Many surgical procedures could benefit from guiding a bevel-tip needle along circular arcs to multiple treatment points in a patient. At each treatment point, the needle...
Steven Bitner, Yam Ki Cheung, Atlas F. Cook, Ovidi...
COMPGEOM
2010
ACM
14 years 2 months ago
Points with large quadrant-depth
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...
Roel Apfelbaum, Itay Ben-Dan, Stefan Felsner, Rom ...
CCCG
2010
13 years 10 months ago
Triangulations with many points of even degree
Let S be a set of points in the plane in general position. A triangulation of S will be called even if all the points of S have an even degree. We show how to construct a triangul...
Jorge Urrutia, Canek Peláez, Adriana Ram&ia...