Space-efficient geometric divide-and-conquer algorithms
Copyright policy )Space-efficient geometric divide-and-conquer algorithms
We present an approach to simulate divide-and-conquer algorithms in a space-efficient way, and illustrate it by giving space-efficient algorithms for the closest-pair, bichromatic closest-pair, all-nearest-neighbors, and orthogonal line segment intersection problems.
German Academic Exchange Service (DAAD)
- University of Münster Germany
- Westfälische Wilhelms Universität Germany
- University of Seville Spain
- Carleton University Canada
Control and Optimization, All-nearest-neighbors, in situ algorithms, Orthogonal line segment intersection, in-place algorithms, Space-efficient algorithms, Computational geometry, Computer Science Applications, Computational Mathematics, Computational Theory and Mathematics, In-place algorithms, Computer graphics; computational geometry (digital and algorithmic aspects), In situ algorithms, Geometry and Topology, space-efficient algorithms, Nonnumerical algorithms
Control and Optimization, All-nearest-neighbors, in situ algorithms, Orthogonal line segment intersection, in-place algorithms, Space-efficient algorithms, Computational geometry, Computer Science Applications, Computational Mathematics, Computational Theory and Mathematics, In-place algorithms, Computer graphics; computational geometry (digital and algorithmic aspects), In situ algorithms, Geometry and Topology, space-efficient algorithms, Nonnumerical algorithms
selected citations These citations are derived from selected sources.This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).20 popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.Average influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).Top 10% impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.Top 10%
Citations provided by BIP!Popularity provided by BIP!