{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,20]],"date-time":"2025-11-20T06:17:09Z","timestamp":1763619429355},"reference-count":22,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[2002,10,1]],"date-time":"2002-10-01T00:00:00Z","timestamp":1033430400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":3942,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[2002,10]]},"DOI":"10.1016\/s0304-3975(01)00409-1","type":"journal-article","created":{"date-parts":[[2002,10,18]],"date-time":"2002-10-18T19:19:50Z","timestamp":1034968790000},"page":"919-937","source":"Crossref","is-referenced-by-count":12,"title":["On local transformation of polygons with visibility properties"],"prefix":"10.1016","volume":"289","author":[{"given":"Carmen","family":"Hernando","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Michael E.","family":"Houle","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ferran","family":"Hurtado","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0304-3975(01)00409-1_BIB1","doi-asserted-by":"crossref","first-page":"711","DOI":"10.1090\/S0002-9904-1976-14122-5","article-title":"Every planar map is four colorable","volume":"82","author":"Appel","year":"1976","journal-title":"Bull. Amer. Math. Soc."},{"issue":"3","key":"10.1016\/S0304-3975(01)00409-1_BIB2","doi-asserted-by":"crossref","first-page":"295","DOI":"10.1007\/BF02293050","article-title":"A pivoting algorithm for convex hulls and vertex enumeration of arrangements and polyhedra","volume":"8","author":"Avis","year":"1992","journal-title":"Discrete Comput. Geom."},{"key":"10.1016\/S0304-3975(01)00409-1_BIB3","doi-asserted-by":"crossref","first-page":"21","DOI":"10.1016\/0166-218X(95)00026-N","article-title":"Reverse search for enumeration","volume":"65","author":"Avis","year":"1996","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/S0304-3975(01)00409-1_BIB4","doi-asserted-by":"crossref","first-page":"910","DOI":"10.1109\/TC.1981.1675729","article-title":"An optimal algorithm for determining the visibility of a polygon from an edge","volume":"C-30","author":"Avis","year":"1981","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/S0304-3975(01)00409-1_BIB5","doi-asserted-by":"crossref","first-page":"223","DOI":"10.1007\/BF01975867","article-title":"Incremental topological flipping works for regular triangulations","volume":"15","author":"Edelsbrunner","year":"1996","journal-title":"Algorithmica"},{"key":"10.1016\/S0304-3975(01)00409-1_BIB6","series-title":"Computing in Euclidean Geometry","first-page":"193","article-title":"Voronoi diagrams and Delaunay triangulations","author":"Fortune","year":"1992"},{"key":"10.1016\/S0304-3975(01)00409-1_BIB7","doi-asserted-by":"crossref","first-page":"191","DOI":"10.1016\/0925-7721(94)90017-5","article-title":"Combinatorial face enumeration in convex polytopes","volume":"4","author":"Fukuda","year":"1994","journal-title":"Comput. Geom. Theory Appl."},{"issue":"2","key":"10.1016\/S0304-3975(01)00409-1_BIB8","doi-asserted-by":"crossref","first-page":"141","DOI":"10.1016\/0166-218X(91)90066-6","article-title":"Combinatorial face enumeration in arrangements and oriented matroids","volume":"31","author":"Fukuda","year":"1991","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/S0304-3975(01)00409-1_BIB9","doi-asserted-by":"crossref","first-page":"51","DOI":"10.1016\/S0166-218X(99)00006-2","article-title":"Geometric tree graphs of points in convex position","volume":"93","author":"Hernando","year":"1999","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/S0304-3975(01)00409-1_BIB10","unstructured":"C. Hernando, F. Hurtado, M. Noy, Graphs of non-crossing matchings. Proc. 15th European Conf. on Computational Geometry 1999, pp. 97\u2013100."},{"key":"10.1016\/S0304-3975(01)00409-1_BIB11","doi-asserted-by":"crossref","first-page":"141","DOI":"10.1007\/BF01553883","article-title":"Finding the visibility graph of a simple polygon in time proportional to its size","volume":"4","author":"Hershberger","year":"1989","journal-title":"Algorithmica"},{"key":"10.1016\/S0304-3975(01)00409-1_BIB12","unstructured":"M.E. Houle, On local transformations of simple polygons, Australian Comput. Sci. Commun. Proc. CATS\u201996, Melbourne 18(3) (1996) 64\u201371."},{"key":"10.1016\/S0304-3975(01)00409-1_BIB13","doi-asserted-by":"crossref","first-page":"179","DOI":"10.1016\/S0925-7721(99)00016-4","article-title":"Graphs of triangulations of a convex polygon and tree of triangulations","volume":"13","author":"Hurtado","year":"1999","journal-title":"Comput. Geom. Theory Appl."},{"key":"10.1016\/S0304-3975(01)00409-1_BIB14","doi-asserted-by":"crossref","first-page":"333","DOI":"10.1007\/PL00009464","article-title":"Flipping edges in triangulations","volume":"22","author":"Hurtado","year":"1999","journal-title":"Discrete Comput. Geom."},{"key":"10.1016\/S0304-3975(01)00409-1_BIB15","doi-asserted-by":"crossref","first-page":"123","DOI":"10.1016\/0167-8396(91)90038-D","article-title":"Construction of three-dimensional Delaunay triangulations using local transformations","volume":"8","author":"Joe","year":"1991","journal-title":"Comput. Aided Geom. Design"},{"key":"10.1016\/S0304-3975(01)00409-1_BIB16","doi-asserted-by":"crossref","first-page":"365","DOI":"10.1016\/0012-365X(72)90093-3","article-title":"Transforming triangulations","volume":"3","author":"Lawson","year":"1972","journal-title":"Discrete Math."},{"key":"10.1016\/S0304-3975(01)00409-1_BIB17","unstructured":"F.H. Lutz, Triangulated Manifolds with Few Vertices and Vertex-Transitive Group Actions, Doctoral Dissertation D-83, Technische Universit\u00e4t Berlin, Shaker Verlag, Aachen, Germany, 1999."},{"key":"10.1016\/S0304-3975(01)00409-1_BIB18","doi-asserted-by":"crossref","first-page":"309","DOI":"10.1002\/jgt.3190190304","article-title":"R(4,5)=25","volume":"19","author":"McKay","year":"1995","journal-title":"J. Graph Theory"},{"key":"10.1016\/S0304-3975(01)00409-1_BIB19","series-title":"Art Gallery Theorems and Algorithms","author":"O'Rourke","year":"1987"},{"key":"10.1016\/S0304-3975(01)00409-1_BIB20","doi-asserted-by":"crossref","unstructured":"M. Pocchiola, G. Vegter, Computing the visibility graph via pseudo-triangulations. Proc. 11th ACM Symp. Comp. Geom. 1995, pp. 248\u2013257.","DOI":"10.1145\/220279.220306"},{"key":"10.1016\/S0304-3975(01)00409-1_BIB21","doi-asserted-by":"crossref","first-page":"17","DOI":"10.1090\/S1079-6762-96-00003-0","article-title":"A new proof of the four colour theorem","volume":"2","author":"Robertson","year":"1996","journal-title":"Electron. Res. Announc. Amer. Math. Soc."},{"key":"10.1016\/S0304-3975(01)00409-1_BIB22","doi-asserted-by":"crossref","first-page":"277","DOI":"10.1016\/0925-7721(95)00031-3","article-title":"Generating random polygons with given vertices","volume":"6","author":"Zhu","year":"1996","journal-title":"Comput. Geom. Theory Appl."}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397501004091?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397501004091?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,28]],"date-time":"2019-04-28T15:23:52Z","timestamp":1556465032000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0304397501004091"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002,10]]},"references-count":22,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2002,10]]}},"alternative-id":["S0304397501004091"],"URL":"https:\/\/doi.org\/10.1016\/s0304-3975(01)00409-1","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[2002,10]]}}}