Fast computation of the modality of polygons-Reference-Cited by-同舟云学术

Fast computation of the modality of polygons

Published:1986-09 Issue:3 Volume:7 Page:369-381
ISSN:0196-6774
Container-title:Journal of Algorithms
language:en
Short-container-title:Journal of Algorithms

Author:

Aggarwal Alok,Melville Robert C

Publisher

Elsevier BV

Subject

Computational Theory and Mathematics,Computational Mathematics,Control and Optimization

Reference13 articles.

1. On the multimodality of distance in convex polygons;Avis;Comput. Math. Appl.,1982

2. A counterexample to a diameter algorithm for convex polygons;Bhattacharya;IEEE Trans. Pattern Anal. Mach. Intell.,1982

3. The Power of Geometric Duality;Chazelle,1983

4. On a General Method for Maximizing and Minimizing among Geometric Problems;Dobkin,1979

5. H. Edelsbrunner and H. Welzl, “Half Planar Range Search in Linear Space and O(nlog(5+1)−1) Query Time”, Bericht 111, Institute for Information Processing, Technical University of Graz, Austria .

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

1. Time-Optimal Proximity Graph Computations on Enhanced Meshes;Journal of Parallel and Distributed Computing;1998-03

2. Generalized Kraft’s Inequality and Discrete k-Modal Search;SIAM Journal on Computing;1996-04

3. Efficient Minimum Cost Matching and Transportation Using the Quadrangle Inequality;Journal of Algorithms;1995-07

4. Convexity Problems on Meshes with Multiple Broadcasting;Journal of Parallel and Distributed Computing;1995-06

5. Time-optimal nearest-neighbor computations on enhanced meshes;PARLE'94 Parallel Architectures and Languages Europe;1994