Sciweavers

229 search results - page 7 / 46
» On the Number of Arrangements of Pseudolines
Sort
View
CVPR
2011
IEEE
12 years 11 months ago
Multiscale Geometric and Spectral Analysis of Plane Arrangements
Modeling data by multiple low-dimensional planes is an important problem in many applications such as computer vision and pattern recognition. In the most general setting where on...
Guangliang Chen, Mauro Maggioni
DCG
2000
67views more  DCG 2000»
13 years 7 months ago
A Theorem on Higher Bruhat Orders
We show that inclusion order and single-step inclusion coincide for higher Bruhat orders B(n; 2), i.e., B(n; 2) = B (n; 2). Mathematics Subject Classi cations (1991). 06A06, 51G05,...
Stefan Felsner, Helmut Weil
COMPGEOM
2008
ACM
13 years 9 months ago
The complexity of the outer face in arrangements of random segments
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 ...
Noga Alon, Dan Halperin, Oren Nechushtan, Micha Sh...
SODA
2001
ACM
105views Algorithms» more  SODA 2001»
13 years 9 months ago
Online point location in planar arrangements and its applications
Recently, Har-Peled [HP99b] presented a new randomized technique for online construction of the zone of a curve in a planar arrangement of arcs. In this paper, we present several ...
Sariel Har-Peled, Micha Sharir
CORR
2011
Springer
206views Education» more  CORR 2011»
13 years 2 months ago
Arrangement Computation for Planar Algebraic Curves
We present a new certified and complete algorithm to compute arrangements of real planar algebraic curves. Our algorithm provides a geometric-topological analysis of the decompos...
Eric Berberich, Pavel Emeliyanenko, Alexander Kobe...