122 search results - page 5 / 25 » Crossed lines |
CCCG
2007
13 years 9 months ago
2007
We give a simple O(n log n) algorithm to compute the convex hull of the (possibly Θ(n2 )) intersection points in an arrangement of n line segments in the plane. We also show an a...
COMPGEOM
2000
ACM
13 years 12 months ago
2000
ACM
We present an (1+ε)-approximation algorithm for computing the minimum-spanning tree of points in a planar arrangement of lines, where the metric is the number of crossings betwee...
SOFSEM
2005
Springer
14 years 29 days ago
2005
Springer
An outerplanar (also called circular, convex, one-page) drawing of an n-vertex graph G is a drawing in which the vertices are placed on a circle and each edge is drawn using one s...
QUESTA
2011
12 years 10 months ago
2011
Motivated by service levels in terms of the waiting-time distribution seen in e.g. call centers, we consider two models for systems with a service discipline that depends on the w...
ICIP
1994
IEEE
14 years 9 months ago
1994
IEEE
The development of a system able to detect and track moving people is described. Given a sequence of timevarying images, the goal is to count the number of people crossing a count...