Sciweavers

6437 search results - page 9 / 1288
» Parallel Algorithms for Arrangements
Sort
View
COMPGEOM
2008
ACM
13 years 9 months ago
Visualizing and exploring planar algebraic arrangements: a web application
A web application is presented to compute, plot, and interactively explore planar arrangements induced by algebraic plane curves of arbitrary degree. It produces accurate curve pl...
Pavel Emeliyanenko, Michael Kerber
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...
CORR
2006
Springer
144views Education» more  CORR 2006»
13 years 7 months ago
The minimum linear arrangement problem on proper interval graphs
We present a linear time algorithm for the minimum linear arrangement problem on proper interval graphs. The obtained ordering is a 4-approximation for general interval graphs. 1 ...
Ilya Safro
CCCG
2003
13 years 9 months ago
On shortest paths in line arrangements
In this paper, we show that the shortest path between two points in a grid-like arrangement of two pencils of lines has a particularly simple structure, as was previously conjectu...
Telikepalli Kavitha, Kasturi R. Varadarajan
WEA
2009
Springer
104views Algorithms» more  WEA 2009»
14 years 2 months ago
Univariate Algebraic Kernel and Application to Arrangements
We present a cgal-based univariate algebraic kernel, which provides certied real-root isolation of univariate polynomials with integer coecients and standard functionalities such...
Sylvain Lazard, Luis Mariano Peñaranda, Eli...