Abstract
Let P be a set of pomts m the plane with rectdmear distance An O(n log n) algonthm for the construeUon ofa Voronot diagram for P ts gwen By using prewously known results, a mmmaal spammuag tree for P can be derived from a Voronot diagram for P m hnear tmae. © 1979, ACM. All rights reserved.
Author supplied keywords
Cite
CITATION STYLE
APA
Hwang, F. K. (1979). An O(n log n) Algorithm for Rectilinear Minimal Spanning Trees. Journal of the ACM (JACM), 26(2), 177–182. https://doi.org/10.1145/322123.322124
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
Already have an account? Sign in
Sign up for free