@inproceedings{a5ed579fa71548f38c6ebe077175d20a,

title = "On the geodesic Voronoi diagram of point sites in a simple polygon",

abstract = "Given a simple polygon with n sides in the plane and a set of k point {"}sites{"} in its interior or on the boundary, compute the Voronoi diagram of the set of sites using the internal {"}geodesic{"} distance inside the polygon as the metric. We describe an O ((n+k )log2(n+k)) time algorithm for solving this problem and sketch a faster 0((n+t)log(n+k)) algorithm for the case when the set of sites includes all reflex vertices of the polygon in question.",

author = "Boris Aronov",

year = "1987",

month = oct,

day = "1",

doi = "10.1145/41958.41963",

language = "English (US)",

series = "Proceedings of the 3rd Annual Symposium on Computational Geometry, SCG 1987",

publisher = "Association for Computing Machinery, Inc",

pages = "39--49",

editor = "D. Soule",

booktitle = "Proceedings of the 3rd Annual Symposium on Computational Geometry, SCG 1987",

note = "3rd Annual Symposium on Computational Geometry, SCG 1987 ; Conference date: 08-06-1987 Through 10-06-1987",

}