23 search results - page 4 / 5 » On Line Arrangements in the Hyperbolic Plane |
116
click to vote
CCCG
2010
15 years 2 months ago
2010
We present a data structure for efficient axis-aligned orthogonal range search on a set of n lines in a bounded plane. The algorithm requires O(log n + k) time in the worst case t...
117
click to vote
DCG
2008
15 years 1 months ago
2008
We investigate algorithmic questions that arise in the statistical problem of computing lines or hyperplanes of maximum regression depth among a set of n points. We work primarily...
146
click to vote
GIAE
2004
Springer
15 years 6 months ago
2004
Springer
This paper first gives a brief overview over some interesting descriptions of conic sections, showing formulations in the three geometric algebras of Euclidean spaces, projective ...
100
click to vote
COMPGEOM
2008
ACM
15 years 3 months ago
2008
ACM
We investigate the complexity of the outer face in arrangements of line segments of a fixed length in the plane, drawn uniformly at random within a square. We derive upper bounds ...
101
Voted
ISVD
2007
IEEE
15 years 7 months ago
2007
IEEE
Given a set of points called sites, the Voronoi diagram is a partition of the plane into sets of points having the same closest site. Several generalizations of the Voronoi diagra...