Neither the greedy nor the delaunay triangulation of a planar point set approximates the optimal triangulation-Reference-Cited by-同舟云学术

Neither the greedy nor the delaunay triangulation of a planar point set approximates the optimal triangulation

Published:1979-07 Issue:1 Volume:9 Page:31-34
ISSN:0020-0190
Container-title:Information Processing Letters
language:en
Short-container-title:Information Processing Letters

Author:

Manacher Glenn K.,Zobrist Albert L.

Publisher

Elsevier BV

Subject

Computer Science Applications,Information Systems,Signal Processing,Theoretical Computer Science

Reference8 articles.

1. Worst-case analysis of a new heuristic for the Travelling Salesman Problem;Christofides,1976

2. Big omicron and big omega and big theta;Knuth;SIGACT news,1976

3. On triangulations of a set of points in the plane;Lloyd;Proc. 18th Annual IEEE Conference on the Foundations of Computer Science,1977

4. A fast, space-efficient average-case algorithm for the ‘greedy’ triangulation of a point set, and a proof that the greedy triangulation is not approximately optimal;Manacher;Proc. Sixteenth Annual Allerton Conference on Communication, Control and Computing,1978

5. Combinatorial Algorithms, Theory and Practice;Reingold,1977

Cited by 48 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Revisiting Fraser's Triangles as the Basis for Estimating Tree Density, Spatial Distribution, and Stocking;Forest Science;2016-10-11

2. Drawings of Graphs;Discrete Mathematics and Its Applications;2013-11-26

3. Computer Reconstruction of Plant Growth and Chlorophyll Fluorescence Emission in Three Spatial Dimensions;Sensors;2012-01-18

4. Approximations on Minimum Weight Triangulations and Minimum Weight Pseudo-Triangulations Using Ant Colony Optimization Metaheuristic;Fundamenta Informaticae;2012

5. Triangulations in Mathematics;Triangulations;2010