Partitioning arrangements of lines: I. An efficient deterministic algorithm

Ediciones (1)

• Partitioning arrangements of lines: I. An efficient deterministic algorithm. (1989)

  Courant Institute of Mathematical Sciences, New York University · inglés

Más obras de Pankaj K. Agarwal

RRobotics : the Algorithmic Perspective

Robotics : the Algorithmic Perspective

CCombinatorial Geometry

Combinatorial Geometry

Computing external-farthest neighbors for a simple polygon