ISOMORPHISM OF SPIRAL POLYGONS

Authors
MACDONALD G SHERMER T
Citation
G. Macdonald et T. Shermer, ISOMORPHISM OF SPIRAL POLYGONS, Discrete & computational geometry, 16(3), 1996, pp. 277-304
Citations number
15
Categorie Soggetti
Computer Sciences, Special Topics","Mathematics, General","Computer Science Theory & Methods",Mathematics
Journal title
Discrete & computational geometry → ACNP
ISSN journal
01795376
Volume
16
Issue
3
Year of publication
1996
Pages
277 - 304
Database
ISI
SICI code
0179-5376(1996)16:3<277:IOSP>2.0.ZU;2-Q
Abstract
We call two polygons isomorphic if there is a one-to-one mapping betwe en their points (not vertices) that preserves visibility. In this pape r we establish necessary and sufficient conditions for two spiral poly gons to be isomorphic, and give an O(n(2)) algorithm to detect such is omorphism. We also show that the continuous graph of visibility on the points of a spiral polygon is an (uncountably infinite) interval grap h, and that no other polygons have this property.