Sciweavers

52 search results - page 1 / 11
» General Balanced Subdivision of Two Sets of Points in the Pl...
Sort
View
JCDCG
2000
Springer
13 years 11 months ago
Generalized Balanced Partitions of Two Sets of Points in the Plane
We consider the following problem. Let n 2, b 1 and q 2 be integers. Let R and B be two disjoint sets of n red points and bn blue points in the plane, respectively, such that no...
Atsushi Kaneko, Mikio Kano
CORR
1999
Springer
222views Education» more  CORR 1999»
13 years 7 months ago
Analysis of approximate nearest neighbor searching with clustered point sets
Abstract. Nearest neighbor searching is a fundamental computational problem. A set of n data points is given in real d-dimensional space, and the problem is to preprocess these poi...
Songrit Maneewongvatana, David M. Mount
WAE
2000
95views Algorithms» more  WAE 2000»
13 years 8 months ago
Two-Dimensional Arrangements in CGAL and Adaptive Point Location for Parametric Curves
Given a collection C of curves in the plane, the arrangement of C is the subdivision of the plane into vertices, edges and faces induced by the curves in C. Constructing arrangemen...
Iddo Hanniel, Dan Halperin
DCG
2010
93views more  DCG 2010»
13 years 7 months ago
The Number of Generalized Balanced Lines
Let S be a set of r red points and b = r +2 blue points in general position in the plane. A line determined by them is said to be balanced if in each open half-plane bounded by th...
David Orden, Pedro Ramos, Gelasio Salazar