Time-optimal proximity graph computations on enhanced meshes

DOI10.1006/JPDC.1997.1421MaRDI QIDQ1268803zbMATH OpenOpenAlexFDO

Authors Stephan Olariu, Ivan Stojmenović, Albert Y. Zomaya

Publication date 30 March 1999

Published in Journal of Parallel and Distributed Computing (Search for Journal in Brave)

Full work available at URL https://semanticscholar.org/paper/77882da0db190c6be885ac5fda54a7f7ef63c12e

zbMATH Keywords

unimodal polygon

Mathematics Subject Classification ID

Pattern recognition, speech recognition (68T10) Distributed algorithms (68W15)

Recommendations

• OPTIMAL MESH ALGORITHMS FOR PROXIMITY AND VISIBILITY PROBLEMS IN SIMPLE POLYGONS*
• The Relative Neighborhood Graph, with an Application to Minimum Spanning Trees
• A simple linear-time algorithm for computing the ring and MST of unimodal polygons
• Convexity problems on meshes with multiple broadcasting
• scientific article; zbMATH DE number 1830717

Cited in

(3)

• New sequential and parallel algorithms for computing the \(\beta\)-spectrum
• Solving cheap graph problems on Meshes
• Optimal and suboptimal robust algorithms for proximity graphs

This page was built for publication: Time-optimal proximity graph computations on enhanced meshes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1268803)