Recent Results on the Average Time Behavior of Some Algorithms in Computational Geometry

Luc Devroye
Additional contact information
Luc Devroye: McGill University, The School of Computer Science

A chapter in Computer Science and Statistics: Proceedings of the 13th Symposium on the Interface, 1981, pp 76-82 from Springer

Abstract: Abstract We give a brief inexhaustive survey of recent results that can be helpful in the average time analysis of algorithms in computational geometry. Most fast average time algorithms use one of three principles: bucketing, divide-and-conquer (merging), or quick elimination (throw-away). To illustrate the different points, the convex hull problem is taken as our prototype problem. We also discuss searching, sorting, finding the Voronoi diagram and the minimal spanning tree, identifying the set of maximal vextors, and determining the diameter of a set and the minimum covering sphere.

Keywords: Algorithms; Average time; Computational geometry; Convex hull; Sorting; Searching; Closest point problems; Divide and conquer (search for similar items in EconPapers)
Date: 1981
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:sprchp:978-1-4613-9464-8_12

Ordering information: This item can be ordered from
http://www.springer.com/9781461394648

DOI: 10.1007/978-1-4613-9464-8_12

Access Statistics for this chapter

More chapters in Springer Books from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().