• search
    search
  • reviewers
    reviewers
  • feeds
    feeds
  • assignments
    assignments
  • settings
  • logout

An O(n log n) Plane-Sweep Algorithm for L_1 and L_\infty Delaunay Triangulations.

Gary M. ShuteLinda L. DeneenClark D. Thomborson
Published in: Algorithmica (1991)
Keyphrases
  • worst case
  • k means
  • delaunay triangulations
  • tree structure
  • path planning
  • social networks
  • three dimensional
  • segmentation algorithm
  • convex hull
  • range data
  • distance transform
  • optimal path