{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,3]],"date-time":"2025-12-03T17:25:16Z","timestamp":1764782716323},"reference-count":7,"publisher":"Elsevier BV","issue":"1-2","license":[{"start":{"date-parts":[[2001,10,1]],"date-time":"2001-10-01T00:00:00Z","timestamp":1001894400000},"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":4307,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Computational Geometry"],"published-print":{"date-parts":[[2001,10]]},"DOI":"10.1016\/s0925-7721(01)00031-1","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T16:47:40Z","timestamp":1027615660000},"page":"3-12","source":"Crossref","is-referenced-by-count":6,"title":["Enumerating triangulation paths"],"prefix":"10.1016","volume":"20","author":[{"given":"Adrian","family":"Dumitrescu","sequence":"first","affiliation":[]},{"given":"Bernd","family":"G\u00e4rtner","sequence":"additional","affiliation":[]},{"given":"Samuele","family":"Pedroni","sequence":"additional","affiliation":[]},{"given":"Emo","family":"Welzl","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0925-7721(01)00031-1_BIB001","series-title":"Proc. of 15th Ann. ACM Symp. on Comput. Geom.","first-page":"14","article-title":"The path of a triangulation","author":"Aichholzer","year":"1999"},{"key":"10.1016\/S0925-7721(01)00031-1_BIB002","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\/S0925-7721(01)00031-1_BIB003","series-title":"Proc. of 14th Ann. ACM Symp. on Comput. Geom.","first-page":"96","article-title":"Implementations of the LMT heuristic for minimum weight triangulation","author":"Beirouti","year":"1998"},{"key":"10.1016\/S0925-7721(01)00031-1_BIB004","series-title":"Computing in Euclidean Geometry","article-title":"Mesh generation and optimal triangulation","author":"Bern","year":"1992"},{"key":"10.1016\/S0925-7721(01)00031-1_BIB005","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1007\/BF01553881","article-title":"Constrained Delaunay triangulations","volume":"4","author":"Chew","year":"1989","journal-title":"Algorithmica"},{"key":"10.1016\/S0925-7721(01)00031-1_BIB006","series-title":"Proc. of 9th Canadian Conf. on Comput. Geom.","first-page":"39","article-title":"Encoding a triangulation as a permutation of its point set","author":"Denny","year":"1997"},{"key":"10.1016\/S0925-7721(01)00031-1_BIB007","unstructured":"B. Erkinger, Struktureigenschaften von Triangulierungen, Diplomarbeit, TU Graz, 1998"}],"container-title":["Computational Geometry"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0925772101000311?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0925772101000311?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,25]],"date-time":"2019-04-25T16:54:08Z","timestamp":1556211248000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0925772101000311"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001,10]]},"references-count":7,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2001,10]]}},"alternative-id":["S0925772101000311"],"URL":"https:\/\/doi.org\/10.1016\/s0925-7721(01)00031-1","relation":{},"ISSN":["0925-7721"],"issn-type":[{"value":"0925-7721","type":"print"}],"subject":[],"published":{"date-parts":[[2001,10]]}}}