Sciweavers

28 search results - page 5 / 6
» Binary plane partitions for disjoint line segments
Sort
View
SODA
1997
ACM
119views Algorithms» more  SODA 1997»
13 years 7 months ago
Map Labeling and Its Generalizations
Map labeling is of fundamental importance in cartography and geographical information systems and is one of the areas targeted for research by the ACM Computational Geometry Impac...
Srinivas Doddi, Madhav V. Marathe, Andy Mirzaian, ...
SOFSEM
2007
Springer
13 years 12 months ago
Straightening Drawings of Clustered Hierarchical Graphs
In this paper we deal with making drawings of clustered hierarchical graphs nicer. Given a planar graph G = (V, E) with an assignment of the vertices to horizontal layers, a plane ...
Sergey Bereg, Markus Völker, Alexander Wolff,...
IJCGA
2008
132views more  IJCGA 2008»
13 years 5 months ago
Constructing the City Voronoi Diagram Faster
Given a set S of n point sites in the plane, the City Voronoi diagram partitions the plane into the Voronoi regions of the sites, with respect to the City metric. This metric is i...
Robert Görke, Chan-Su Shin, Alexander Wolff
DAGM
2007
Springer
13 years 12 months ago
WarpCut - Fast Obstacle Segmentation in Monocular Video
Abstract. Autonomous collision avoidance in vehicles requires an accurate seperation of obstacles from the background, particularly near the focus of expansion. In this paper, we p...
Andreas Wedel, Thomas Schoenemann, Thomas Brox, Da...
COMPGEOM
2010
ACM
13 years 11 months ago
Optimal partition trees
We revisit one of the most fundamental classes of data structure problems in computational geometry: range searching. Back in SoCG’92, Matouˇsek gave a partition tree method fo...
Timothy M. Chan