1012 search results - page 9 / 203 » Segment intersection searching problems in general settings |
IV
2009
IEEE
14 years 2 months ago
2009
IEEE
Most methods for generating Euler diagrams describe the detection of the general structure of the final draw as the first and most important step. This information is often depi...
CORR
2010
Springer
13 years 7 months ago
2010
Springer
The problem of finding "small" sets that meet every straight-line which intersects a given convex region was initiated by Mazurkiewicz in 1916. We call such a set an opa...
GD
2004
Springer
14 years 22 days ago
2004
Springer
We initiate a new problem of automatic metro map layout. In general, a metro map consists of a set of lines which have intersections or overlaps. We define a set of aesthetic crit...
GECCO
2007
Springer
14 years 1 months ago
2007
Springer
Dividing the set of nodes into clusters in the well-known traveling salesman problem results in the generalized traveling salesman problem which seeking a tour with minimum cost p...
FSTTCS
2004
Springer
14 years 22 days ago
2004
Springer
We show how any BSP tree TP for the endpoints of a set of n disjoint segments in the plane can be used to obtain a BSP tree of size O(n · depth(TP )) for the segments themselves, ...