{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,9]],"date-time":"2026-05-09T02:40:11Z","timestamp":1778294411846,"version":"3.51.4"},"reference-count":21,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1989,1,1]],"date-time":"1989-01-01T00:00:00Z","timestamp":599616000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[1989,1,1]],"date-time":"1989-01-01T00:00:00Z","timestamp":599616000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2009,4,8]],"date-time":"2009-04-08T00:00:00Z","timestamp":1239148800000},"content-version":"vor","delay-in-days":7402,"URL":"http:\/\/creativecommons.org\/licenses\/by-nc-nd\/4.0\/"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Journal of Symbolic Computation"],"published-print":{"date-parts":[[1989,1]]},"DOI":"10.1016\/s0747-7171(89)80003-3","type":"journal-article","created":{"date-parts":[[2008,4,9]],"date-time":"2008-04-09T10:00:48Z","timestamp":1207735248000},"page":"11-30","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":128,"title":["Visibility problems for polyhedral terrains"],"prefix":"10.1016","volume":"7","author":[{"given":"Richard","family":"Cole","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Micha","family":"Sharir","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0747-7171(89)80003-3_bib1","series-title":"Improved upper and lower bounds on the length of Davenport-Schinzel sequences (to appear in J. Comb. Theory A)","author":"Agarwal","year":"1988"},{"key":"10.1016\/S0747-7171(89)80003-3_bib2_1","first-page":"92","article-title":"Dynamic computational geometry","author":"Atallah","year":"1983","journal-title":"Proc. 24th Symp. Foundations of Computer Science"},{"key":"10.1016\/S0747-7171(89)80003-3_bib2_2","doi-asserted-by":"crossref","first-page":"1171","DOI":"10.1016\/0898-1221(85)90105-1","volume":"11","year":"1985","journal-title":"Comp. Math. Appl."},{"key":"10.1016\/S0747-7171(89)80003-3_bib3","doi-asserted-by":"crossref","first-page":"133","DOI":"10.1007\/BF01840440","article-title":"Fractional cascading: I. A data structuring technique","volume":"1","author":"Chazelle","year":"1986","journal-title":"Algorithmica"},{"key":"10.1016\/S0747-7171(89)80003-3_bib4","first-page":"135","article-title":"Visibility and intersection problems in plane geometry","author":"Chazelle","year":"1985","journal-title":"Proc. ACM Syrup. Computational Geometry"},{"key":"10.1016\/S0747-7171(89)80003-3_bib5","doi-asserted-by":"crossref","first-page":"39","DOI":"10.1016\/0095-8956(75)90061-1","article-title":"A combinatorial theorem in plane geometry","volume":"18","author":"Chvatal","year":"1975","journal-title":"J. Comb. Theory B"},{"key":"10.1016\/S0747-7171(89)80003-3_bib6","doi-asserted-by":"crossref","first-page":"202","DOI":"10.1016\/0196-6774(86)90004-0","article-title":"Searching and storing similar lists","volume":"7","author":"Cole","year":"1986","journal-title":"J. Algorithms"},{"key":"10.1016\/S0747-7171(89)80003-3_bib7","first-page":"109","article-title":"Making data structures persistent","author":"Driscoll","year":"1986","journal-title":"Proc. 18th Syrup. Theory of Computing"},{"key":"10.1016\/S0747-7171(89)80003-3_bib8","series-title":"Proc. lnt. Syrup. Spatial Data Handling","article-title":"A visibility-based model for terrain features","author":"De Floriani","year":"1986"},{"key":"10.1016\/S0747-7171(89)80003-3_bib9","first-page":"269","article-title":"Quadratic bounds for hidden line elimination","author":"Devai","year":"1986","journal-title":"Proc. 2nd ACM Syrup. Computational Geometry"},{"key":"10.1016\/S0747-7171(89)80003-3_bib10","first-page":"317","article-title":"Optimal point location in a monotone subdivision","volume":"15","author":"Edelsbrunner","year":"1986","journal-title":"SlAM J. Comput."},{"key":"10.1016\/S0747-7171(89)80003-3_bib11","doi-asserted-by":"crossref","first-page":"39","DOI":"10.1016\/0020-0190(85)90107-3","article-title":"Finding extreme points in three dimensions and solving the post-office problem in the plane","volume":"21","author":"Edelsbrunner","year":"1985","journal-title":"Inf. Proc. Lett."},{"key":"10.1016\/S0747-7171(89)80003-3_bib12","series-title":"Computers and Intractability: A Gzdde to the Theory of NP-Completeness","author":"Garey","year":"1979"},{"key":"10.1016\/S0747-7171(89)80003-3_bib13","doi-asserted-by":"crossref","first-page":"209","DOI":"10.1007\/BF01840360","article-title":"Linear time algorithms for visibility and shortest path problems inside triangulated simple polygons","volume":"2","author":"Guibas","year":"1987","journal-title":"Algorithmica"},{"key":"10.1016\/S0747-7171(89)80003-3_bib14","doi-asserted-by":"crossref","first-page":"151","DOI":"10.1007\/BF02579170","article-title":"Nonlinearity of Davenport-Schinzel sequences and of generalized path compression schemes","volume":"6","author":"Hart","year":"1986","journal-title":"Combinatorica"},{"key":"10.1016\/S0747-7171(89)80003-3_bib15","series-title":"Teeh. Rep. JHU\/EECS-86\/05","article-title":"Worst-case optimal hidden-surface removal","author":"McKenna","year":"1986"},{"key":"10.1016\/S0747-7171(89)80003-3_bib16","first-page":"123","article-title":"An algorithm for constructing the aspect graph","author":"Plantinga","year":"1986","journal-title":"Proc. 27th Syrup. Foundations of Computer Science"},{"key":"10.1016\/S0747-7171(89)80003-3_bib17","doi-asserted-by":"crossref","first-page":"45","DOI":"10.1016\/0304-3975(79)90055-0","article-title":"Finding the intersection of h half spaces in time O(n log n)","volume":"8","author":"Preparata","year":"1979","journal-title":"Theoret. Comp. Sci."},{"key":"10.1016\/S0747-7171(89)80003-3_bib18","doi-asserted-by":"crossref","first-page":"131","DOI":"10.1007\/BF02579209","article-title":"Almost linear upper bounds on the length of general Davenport-Schinzel sequences","volume":"7","author":"Sharir","year":"1987","journal-title":"Combinatorica"},{"key":"10.1016\/S0747-7171(89)80003-3_bib19","doi-asserted-by":"crossref","first-page":"117","DOI":"10.1007\/BF02122559","article-title":"Improved lower bounds on the length of Davenport-Schinzel sequences","volume":"8","author":"Sharir","year":"1986","journal-title":"Combinatorica"},{"key":"10.1016\/S0747-7171(89)80003-3_bib20","doi-asserted-by":"crossref","first-page":"15","DOI":"10.1007\/BF02187894","article-title":"Planar realization of nonlinear Davenport-Schinzel sequences by segments","volume":"3","author":"Wiernik","year":"1988","journal-title":"Discrete Comp. Geom."}],"container-title":["Journal of Symbolic Computation"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0747717189800033?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0747717189800033?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2025,10,9]],"date-time":"2025-10-09T07:47:50Z","timestamp":1759996070000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0747717189800033"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1989,1]]},"references-count":21,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1989,1]]}},"alternative-id":["S0747717189800033"],"URL":"https:\/\/doi.org\/10.1016\/s0747-7171(89)80003-3","relation":{},"ISSN":["0747-7171"],"issn-type":[{"value":"0747-7171","type":"print"}],"subject":[],"published":{"date-parts":[[1989,1]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Visibility problems for polyhedral terrains","name":"articletitle","label":"Article Title"},{"value":"Journal of Symbolic Computation","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/S0747-7171(89)80003-3","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"Copyright \u00a9 1989 Published by Elsevier Ltd.","name":"copyright","label":"Copyright"}]}}