{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,4,9]],"date-time":"2025-04-09T16:51:13Z","timestamp":1744217473956,"version":"3.40.2"},"publisher-location":"Berlin, Heidelberg","reference-count":73,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540542339"},{"type":"electronic","value":"9783540475163"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1991]]},"DOI":"10.1007\/3-540-54233-7_174","type":"book-chapter","created":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T22:38:39Z","timestamp":1330209519000},"page":"686-696","source":"Crossref","is-referenced-by-count":2,"title":["Computational geometry for the gourmet old fare and new dishes"],"prefix":"10.1007","author":[{"given":"Bernard","family":"Chazelle","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,8]]},"reference":[{"key":"54_CR1","doi-asserted-by":"crossref","first-page":"449","DOI":"10.1007\/BF02187805","volume":"5","author":"P.K. Agarwal","year":"1990","unstructured":"Agarwal, P.K. Partitioning arrangements of lines I: An efficient deterministic algorithm, Disc. Comput. Geom. 5 (1990), 449\u2013483.","journal-title":"Disc. Comput. Geom."},{"key":"54_CR2","doi-asserted-by":"crossref","first-page":"533","DOI":"10.1007\/BF02187809","volume":"5","author":"P.K. Agarwal","year":"1990","unstructured":"Agarwal, P.K., Partitioning arrangements of lines: II. Applications, Disc. Comput. Geom. 5 (1990), 533\u2013573.","journal-title":"Disc. Comput. Geom."},{"key":"54_CR3","unstructured":"Agarwal, P.K., Sharir, M. Applications of a new partitioning scheme, manuscript, 1990."},{"key":"54_CR4","doi-asserted-by":"crossref","unstructured":"Aronov, B., Sharir, M. Triangles in space, or building and analyzing castles in the air, Proc. 4th Ann. ACM Sympos. Comput. Geom. (1988), 381\u2013391.","DOI":"10.1145\/73393.73432"},{"key":"54_CR5","doi-asserted-by":"crossref","first-page":"49","DOI":"10.1016\/0022-0000(90)90018-G","volume":"40","author":"M. Bern","year":"1990","unstructured":"Bern, M. Hidden surface removal for rectangles, J. Comput. Sys. Sci. 40 (1990) 49\u201369.","journal-title":"J. Comput. Sys. Sci."},{"key":"54_CR6","doi-asserted-by":"crossref","unstructured":"Caniglia, L., Galligo, A. and Heintz, J. Some new effectivity bounds in computational geometry, Proc. 6th Internat. Conf. on Applied Algebra, Algorithmic and Error Correcting Codes, Rome, July 1988.","DOI":"10.1007\/3-540-51083-4_54"},{"key":"54_CR7","doi-asserted-by":"crossref","unstructured":"Canny, J.F. A new algebraic method for motion planning and real geometry, Proc. 28th Annu. IEEE Symp. on Foundat. of Computer Science (1987), 39\u201348.","DOI":"10.1109\/SFCS.1987.1"},{"key":"54_CR8","doi-asserted-by":"crossref","first-page":"509","DOI":"10.1109\/TIT.1985.1057060","volume":"IT-31","author":"B. Chazelle","year":"1985","unstructured":"Chazelle, B. On the convex layers of a planar set, IEEE Trans. Informat. Theory IT-31 (1985), 509\u2013517.","journal-title":"IEEE Trans. Informat. Theory"},{"key":"54_CR9","doi-asserted-by":"crossref","unstructured":"Chazelle, B. An optimal algorithm for intersecting three-dimensional convex polyhedra, Proc. 30th Ann. IEEE Symp. Found. Comp. Sci. (1989).","DOI":"10.1109\/SFCS.1989.63539"},{"key":"54_CR10","doi-asserted-by":"crossref","first-page":"637","DOI":"10.1090\/S0894-0347-1989-1001852-0","volume":"2","author":"B. Chazelle","year":"1989","unstructured":"Chazelle, B. Lower bounds on the complexity of polytope range searching, J. American Math. Soc. 2 (1989), 637\u2013666.","journal-title":"J. American Math. Soc."},{"key":"54_CR11","doi-asserted-by":"crossref","first-page":"200","DOI":"10.1145\/77600.77614","volume":"37","author":"B. Chazelle","year":"1990","unstructured":"Chazelle, B. Lower bounds for orthogonal range searching: I. The reporting case, J. ACM 37 (1990), 200\u2013212.","journal-title":"J. ACM"},{"key":"54_CR12","doi-asserted-by":"crossref","first-page":"439","DOI":"10.1145\/79147.79149","volume":"37","author":"B. Chazelle","year":"1990","unstructured":"Chazelle, B. Lower bounds for orthogonal range searching: II. The arithmetic model, J. ACM 37 (1990), 439\u2013463.","journal-title":"J. ACM"},{"key":"54_CR13","doi-asserted-by":"crossref","unstructured":"Chazelle, B. Triangulating a simple polygon in linear time, Proc. 31st Annu. IEEE Symp. Foundat. Comput. Sci., (1990), 220\u2013230. To appear in Discrete Comput. Geom. (1991).","DOI":"10.1007\/BF02574703"},{"key":"54_CR14","doi-asserted-by":"crossref","unstructured":"Chazelle, B., Edelsbrunner, H. An optimal algorithm for intersecting line segments in the plane, Proc. 29th Ann. IEEE Symp. Found. Comp. Sci. (1988), 590\u2013600.","DOI":"10.1109\/SFCS.1988.21975"},{"key":"54_CR15","doi-asserted-by":"crossref","unstructured":"Chazelle, B., Edelsbrunner, H., Guibas, L.J., Sharir, M. A singly-exponential stratification scheme for real semi-algebraic varieties and its applications, ICALP (1989) 179\u2013193.","DOI":"10.1007\/BFb0035760"},{"key":"54_CR16","doi-asserted-by":"crossref","first-page":"229","DOI":"10.1007\/BF02122778","volume":"10","author":"B. Chazelle","year":"1990","unstructured":"Chazelle, B., Friedman, J. A deterministic view of random sampling and its use in geometry, Combinatorica 10 (1990), 229\u2013249.","journal-title":"Combinatorica"},{"key":"54_CR17","doi-asserted-by":"crossref","first-page":"133","DOI":"10.1007\/BF01840440","volume":"1","author":"B. Chazelle","year":"1986","unstructured":"Chazelle, B., Guibas, L.J. Fractional cascading: I. A data structuring technique, Algorithmica, 1 (1986), 133\u2013162.","journal-title":"Algorithmica"},{"key":"54_CR18","doi-asserted-by":"crossref","first-page":"76","DOI":"10.1007\/BF01934990","volume":"25","author":"B. Chazelle","year":"1985","unstructured":"Chazelle, B., Guibas, L.J, Lee, D.T. The power of geometric duality, BIT 25 (1985), 76\u201390.","journal-title":"BIT"},{"key":"54_CR19","doi-asserted-by":"crossref","first-page":"135","DOI":"10.1145\/357337.357340","volume":"3","author":"B. Chazelle","year":"1984","unstructured":"Chazelle, B., Incerpi, J. Triangulation and shape-complexity, ACM Trans. on Graphics 3 (1984), 135\u2013152.","journal-title":"ACM Trans. on Graphics"},{"key":"54_CR20","doi-asserted-by":"crossref","unstructured":"Cheng, S., Janardan, R. New results on dynamic point location Proc. 31st Ann. IEEE Symp. Foundat. Comput. Sci. (1990), 96\u2013105.","DOI":"10.1109\/FSCS.1990.89528"},{"key":"54_CR21","doi-asserted-by":"crossref","first-page":"830","DOI":"10.1137\/0217052","volume":"17","author":"K.L. Clarkson","year":"1988","unstructured":"Clarkson, K.L. A randomized algorithm for closest-point queries, SIAM J. Comput. 17 (1988), 830\u2013847.","journal-title":"SIAM J. Comput."},{"key":"54_CR22","doi-asserted-by":"crossref","first-page":"195","DOI":"10.1007\/BF02187879","volume":"2","author":"K.L. Clarkson","year":"1987","unstructured":"Clarkson, K.L. New applications of random sampling in computational geometry, Disc. Comp. Geom. 2 (1987), 195\u2013222.","journal-title":"Disc. Comp. Geom."},{"key":"54_CR23","doi-asserted-by":"crossref","first-page":"99","DOI":"10.1007\/BF02187783","volume":"5","author":"K.L. Clarkson","year":"1990","unstructured":"Clarkson, K.L., Edelsbrunner, H., Guibas, L.J., Sharir, M., Welzl, E. Combinatorial complexity bounds for arrangements of curves and surfaces, Disc. Comput. Geom. 5 (1990), 99\u2013160.","journal-title":"Disc. Comput. Geom."},{"key":"54_CR24","doi-asserted-by":"crossref","first-page":"387","DOI":"10.1007\/BF02187740","volume":"4","author":"K.L. Clarkson","year":"1989","unstructured":"Clarkson, K.L., Shor, P.W. Applications of random sampling in computational geometry, II, Disc. Comp. Geom. 4 (1989), 387\u2013421.","journal-title":"Disc. Comp. Geom."},{"key":"54_CR25","first-page":"432","volume":"4","author":"K.L. Clarkson","year":"1989","unstructured":"Clarkson, K.L., Tarjan, R.E., Van Wyk, C.J. A fast Las Vegas algorithm for triangulating a simple polygon, Disc. and Comput. Geom. 4 (1989), 432\u2013432.","journal-title":"Disc. and Comput. Geom."},{"key":"54_CR26","first-page":"134","volume":"35","author":"G.E. Collins","year":"1975","unstructured":"Collins, G.E. Quantifier elimination for real closed fields by cylindric algebraic decomposition, Proc. 2nd GI Conf. on Automata Theory and Formal Languages, Springer-Verlag, LNCS 35, Berlin (1975), 134\u2013183.","journal-title":"LNCS"},{"key":"54_CR27","doi-asserted-by":"crossref","first-page":"29","DOI":"10.1016\/S0747-7171(88)80004-X","volume":"5","author":"J. Davenport","year":"1988","unstructured":"Davenport, J., Heintz, J. Real quantifier elimination is doubly exponetial, J. Symbolic Comput. 5 (1988), 29\u201335.","journal-title":"J. Symbolic Comput."},{"key":"54_CR28","doi-asserted-by":"crossref","first-page":"241","DOI":"10.1016\/0304-3975(82)90120-7","volume":"27","author":"D.P. Dobkin","year":"1983","unstructured":"Dobkin, D.P., Kirkpatrick, D.G. Fast detection of polyhedral intersection, Theoret. Comput. Sci. 27 (1983), 241\u2013253.","journal-title":"Theoret. Comput. Sci."},{"key":"54_CR29","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-61568-9","volume-title":"Algorithms in Combinatorial Geometry","author":"H. Edelsbrunner","year":"1987","unstructured":"Edelsbrunner, H. Algorithms in Combinatorial Geometry, Springer-Verlag, Heidelberg, Germany, 1987."},{"key":"54_CR30","doi-asserted-by":"crossref","first-page":"341","DOI":"10.1137\/0215024","volume":"15","author":"H. Edelsbrunner","year":"1986","unstructured":"Edelsbrunner, H., O'Rourke, J., Seidel, R. Constructing arrangements of lines and hyperplanes with applications, SIAM J. Comput. 15 (1986), 341\u2013363.","journal-title":"SIAM J. Comput."},{"key":"54_CR31","doi-asserted-by":"crossref","first-page":"355","DOI":"10.1016\/0304-3975(76)90078-5","volume":"1","author":"M.L. Fredman","year":"1976","unstructured":"Fredman, M.L. How good is the information theory bound in sorting?, Theoret. Comput. Sci, 1, pp. 355\u2013361, 1976.","journal-title":"Theoret. Comput. Sci"},{"key":"54_CR32","doi-asserted-by":"crossref","first-page":"696","DOI":"10.1145\/322276.322281","volume":"28","author":"M.L. Fredman","year":"1981","unstructured":"Fredman, M.L. A lower bound on the complexity of orthogonal range queries, J. ACM, 28 (1981), 696\u2013705.","journal-title":"J. ACM"},{"key":"54_CR33","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1137\/0210001","volume":"10","author":"M.L. Fredman","year":"1981","unstructured":"Fredman, M.L. Lower bounds on the complexity of some optimal data structures, SIAM J. Comput. 10 (1981), 1\u201310.","journal-title":"SIAM J. Comput."},{"key":"54_CR34","doi-asserted-by":"crossref","unstructured":"Fuchs, H., Kedem, Z., Naylor, B. On visible surface generation by a priori tree structures, Computer Graphics (SIGGRAPH'80), 124\u2013133.","DOI":"10.1145\/965105.807481"},{"key":"54_CR35","doi-asserted-by":"crossref","first-page":"175","DOI":"10.1016\/0020-0190(78)90062-5","volume":"7","author":"M.R. Garey","year":"1978","unstructured":"Garey, M.R., Johnson, D.S., Preparata, F.P., Tarjan, R.E. Triangulating a simple polygon, Inform. Process. Lett. 7 (1978), 175\u2013180.","journal-title":"Inform. Process. Lett."},{"key":"54_CR36","doi-asserted-by":"crossref","unstructured":"Goodrich, M.F., Atallah, M., Overmars, M. An input-size\/output-size trade-off in the time complexity of rectilinear hidden surface removal, Proc. 16th ICALP.","DOI":"10.1007\/BFb0032067"},{"key":"54_CR37","doi-asserted-by":"crossref","unstructured":"Goodrich, M.F., Tamassia, R. Dynamic trees and dynamic point location, Johns Hopkins Univ. Tech. Rep., 1990.","DOI":"10.1145\/103418.103472"},{"key":"54_CR38","doi-asserted-by":"crossref","first-page":"37","DOI":"10.1016\/S0747-7171(88)80005-1","volume":"5","author":"D. Grigor'ev","year":"1988","unstructured":"Grigor'ev, D. and Vorobjov, N. Solving systems of polynomial inequalities in subexponential time, J. Symbolic Comput. 5 (1988), 37\u201364.","journal-title":"J. Symbolic Comput."},{"key":"54_CR39","doi-asserted-by":"crossref","unstructured":"Guibas, L.J., Seidel, R. Computing convolutions using reciprocal search, Proc. 2nd Ann. ACM Symp. Comput. Geom. (1986), 90\u201399.","DOI":"10.1145\/10515.10525"},{"key":"54_CR40","doi-asserted-by":"crossref","first-page":"127","DOI":"10.1007\/BF02187876","volume":"2","author":"D. Haussler","year":"1987","unstructured":"Haussler, D., Welzl, E. Epsilon-nets and simplex range queries, Disc. Comp. Geom. 2, (1987), 127\u2013151.","journal-title":"Disc. Comp. Geom."},{"key":"54_CR41","doi-asserted-by":"crossref","unstructured":"Hershberger, J., Suri, S. Finding tailored partitions, Proc. 5th Ann. ACM Symp. Comput. Geom. (1989), 255\u2013265.","DOI":"10.1145\/73833.73862"},{"key":"54_CR42","first-page":"207","volume":"158","author":"S. Hertel","year":"1983","unstructured":"Hertel, S., Mehlhorn, K. Fast triangulation of a simple polygon, Proc. Conf. Found. Comput. Theory, New York, Lecture Notes on Computer Science 158 (1983), 207\u2013218.","journal-title":"Proc. Conf. Found. Comput. Theory, New York, Lecture Notes on Computer Science"},{"key":"54_CR43","doi-asserted-by":"crossref","unstructured":"Kirkpatrick, D.G., Klawe, M.M., Tarjan, R.E. O(n log log n) polygon triangulation with simple data structures, Proc. 6th Ann. ACM Symp. Comput. Geom. (1990), 34\u201343.","DOI":"10.1145\/98524.98533"},{"key":"54_CR44","volume-title":"Reporting and counting intersections between two sets of line segments","author":"H.G. Mairson","year":"1987","unstructured":"Mairson, H.G., Stolfi, J. Reporting and counting intersections between two sets of line segments, Proc. NATO Advanced Study Inst. Theoret. Found. Comput. Graphics and CAD, Il Ciocco, Castelvecchio Pascoli, Italy, Springer-Verlag, 1987."},{"key":"54_CR45","doi-asserted-by":"crossref","first-page":"427","DOI":"10.1007\/BF02187804","volume":"5","author":"J. Matou\u0161ek","year":"1990","unstructured":"Matou\u0161ek, J. Construction of \u025b-nets, Disc. Comput. Geom. 5 (1990), 427\u2013448.","journal-title":"Disc. Comput. Geom."},{"key":"54_CR46","doi-asserted-by":"crossref","unstructured":"Matou\u0161ek, J. Approximations and optimal geometric divide-and-conquer, KAM Series (tech. report) 90\u2013174, Charles University, 1990. Also to appear in Proc. 23rd ACM Symp. Theory of Comput., 1991.","DOI":"10.1145\/103418.103470"},{"key":"54_CR47","doi-asserted-by":"crossref","unstructured":"Matou\u0161ek, J. Cutting hyperplane arrangements, to appear in Disc. Comput. Geom., 1991. Also, in Proc. 6th ACM Symp. Comput. Geom. (1990), 1\u20139.","DOI":"10.1007\/BF02574697"},{"key":"54_CR48","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-69900-9","volume-title":"Data Structures and Algorithms 3: Multidimensional Searching and Computational Geometry","author":"K. Mehlhorn","year":"1984","unstructured":"Mehlhorn, K. Data Structures and Algorithms 3: Multidimensional Searching and Computational Geometry, Springer-Verlag, Heidelberg, Germany, 1984."},{"key":"54_CR49","doi-asserted-by":"crossref","first-page":"215","DOI":"10.1007\/BF01840386","volume":"5","author":"K. Mehlhorn","year":"1990","unstructured":"Mehlhorn, K., N\u00e4her, S. Dynamic fractional cascading, Algorithmica 5 (1990), 215\u2013242.","journal-title":"Algorithmica"},{"key":"54_CR50","unstructured":"Mehlhorn, K., Simon, K. Intersecting two polyhedra one of which is convex, Univ. Saarland, Tech. Report, Saarbr\u00fccken, West Germany, 1986."},{"key":"54_CR51","doi-asserted-by":"crossref","unstructured":"Mulmuley, K. A fast planar partition algorithm, Proc. 29th Ann. IEEE Symp. Found. Comp. Sci. (1988).","DOI":"10.1109\/SFCS.1988.21974"},{"key":"54_CR52","doi-asserted-by":"crossref","unstructured":"Mulmuley, K. A fast planar partition algorithm, II, Proc. 5th Ann. ACM Symp. Comp. Geo. (1989), 33\u201343.","DOI":"10.1145\/73833.73837"},{"key":"54_CR53","doi-asserted-by":"crossref","first-page":"739","DOI":"10.1145\/358656.358681","volume":"25","author":"J. Nievergelt","year":"1982","unstructured":"Nievergelt, J., Preparata, F.P. Plane-sweep algorithms for intersecting geometric figures, Comm. ACM, 25 (1982), 739\u2013747.","journal-title":"Comm. ACM"},{"key":"54_CR54","doi-asserted-by":"crossref","unstructured":"Overmars, M., Sharir, M. Output-sensitive hidden surface removal algorithms, Proc. 30th Ann. IEEE Symp. Foundat. Comput. Sci. (1989), 598\u2013603.","DOI":"10.1109\/SFCS.1989.63541"},{"key":"54_CR55","doi-asserted-by":"crossref","unstructured":"Overmars, M., Sharir, M. Merging visibility maps, Proc. 6th Ann. ACM Symp. Comput. Geom. (1990), 168\u2013176.","DOI":"10.1145\/98524.98561"},{"key":"54_CR56","doi-asserted-by":"crossref","first-page":"166","DOI":"10.1016\/0022-0000(81)90012-X","volume":"23","author":"M.H. Overmars","year":"1981","unstructured":"Overmars, M.H., van Leeuwen, J. Maintenance of configurations in the plane, Journal of Computer and System Sciences 23 (1981), 166\u2013204.","journal-title":"Journal of Computer and System Sciences"},{"key":"54_CR57","doi-asserted-by":"crossref","unstructured":"Paterson, M.S., Yao, F.F. Binary partitions with applications to hidden-surface removal and solid modelling, Proc. 5th Ann. ACM Symp. Comput. Geom. (1989), 23\u201332.","DOI":"10.1145\/73833.73836"},{"key":"54_CR58","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4612-1098-6","volume-title":"Computational Geometry","author":"F.P. Preparata","year":"1985","unstructured":"Preparata, F.P., Shamos, M.I. Computational Geometry, Springer-Verlag, New York, 1985."},{"key":"54_CR59","doi-asserted-by":"crossref","unstructured":"Preparata, F.P., Tamassia, R. Fully dynamic techniques for point location and transitive closure in planar structures, Proc. 29th Ann. IEEE Symp. Found. Comp. Sci. (1988), 558\u2013567.","DOI":"10.1109\/SFCS.1988.21972"},{"key":"54_CR60","doi-asserted-by":"crossref","unstructured":"Preparata, F.P., Tamassia, R. Efficient spatial point location, Proc. 1989 Workshop on Algorithms and Data Structures.","DOI":"10.1007\/3-540-51542-9_2"},{"key":"54_CR61","doi-asserted-by":"crossref","first-page":"278","DOI":"10.1145\/78964.78967","volume":"5","author":"F.P. Preparata","year":"1990","unstructured":"Preparata, F.P., Vitter, J., Yvinec, M. Computation of the axial view of a set of isothetic parallelepipeds, ACM Trans. on Graphics 5 (1990), 278\u2013300.","journal-title":"ACM Trans. on Graphics"},{"key":"54_CR62","doi-asserted-by":"crossref","first-page":"972","DOI":"10.1137\/0215069","volume":"15","author":"D. Prill","year":"1986","unstructured":"Prill, D. On approximations and incidence in cylindrical algebraic decompositions, SIAM J. Comput. 15 (1986), 972\u2013993.","journal-title":"SIAM J. Comput."},{"key":"54_CR63","doi-asserted-by":"crossref","unstructured":"Reif, J., Sen, S. An efficient output-sensitive hidden surface removal algorithm and its parallelization, Proc. 4th Ann. ACM Symp. Comput. Geom. (1988), 193\u2013200.","DOI":"10.1145\/73393.73413"},{"key":"54_CR64","doi-asserted-by":"crossref","unstructured":"Renegar, J. A faster PSPACE algorithm for deciding the existential theory of the reals, Proc. 29th Annu. IEEE Symp. on Foundat. of Computer Science (1988), 291\u2013295.","DOI":"10.1109\/SFCS.1988.21945"},{"key":"54_CR65","doi-asserted-by":"crossref","first-page":"298","DOI":"10.1016\/0196-8858(83)90014-3","volume":"4","author":"J.T. Schwartz","year":"1983","unstructured":"Schwartz, J.T., Sharir, M. On the \u201cpiano movers\u201d problem. II: General techniques for computing topological properties of real algebraic manifolds, Adv. in Appl. Math. 4 (1983), 298\u2013351.","journal-title":"Adv. in Appl. Math."},{"key":"54_CR66","unstructured":"Seidel, R. A convex hull algorithm optimal for point sets in even dimensions, Univ. British Columbia, tech. Rep. 81\u201314, 1981."},{"key":"54_CR67","doi-asserted-by":"crossref","unstructured":"Seidel, R. Constructing higher-dimensional convex hulls at logarithmic cost per face, Proc. 18th Ann. ACM Symp. Theory Comput. (1986), 404\u2013413.","DOI":"10.1145\/12130.12172"},{"key":"54_CR68","doi-asserted-by":"crossref","unstructured":"Seidel, R. Linear programming and convex hulls made easy, Proc. 6th Ann. ACM Symp. Comput. Geom. (1990), 211\u2013215.","DOI":"10.1145\/98524.98570"},{"key":"54_CR69","doi-asserted-by":"crossref","unstructured":"Seidel, R. A simple and fast incremental randomized algorithm for computing trapezoidal decompositions and for triangulating polygons, manuscript, 1990.","DOI":"10.1016\/0925-7721(91)90012-4"},{"key":"54_CR70","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/356625.356626","volume":"6","author":"I.E. Sutherland","year":"1974","unstructured":"Sutherland, I.E., Sproull, R.F., Schumaker, R.A. A characterization of ten hidden surface algorithms, Computing Surveys 6 (1974), 1\u201355.","journal-title":"Computing Surveys"},{"key":"54_CR71","doi-asserted-by":"crossref","first-page":"143","DOI":"10.1137\/0217010","volume":"17","author":"R.E. Tarjan","year":"1988","unstructured":"Tarjan, R.E., Van Wyk, C.J. An O(n log log n)-time algorithm for triangulating a simple polygon, SIAM J. Comput. 17 (1988), 143\u2013178.","journal-title":"SIAM J. Comput."},{"key":"54_CR72","doi-asserted-by":"crossref","unstructured":"Whitney, H. Elementary structure of real algebraic varieties, Annals of Math. 66 (1957).","DOI":"10.2307\/1969908"},{"key":"54_CR73","doi-asserted-by":"crossref","unstructured":"Willard, D.E. Lower bounds for dynamic range query problems that permit subtraction, Proc. 13th ICALP, 1986.","DOI":"10.1007\/3-540-16761-7_94"}],"container-title":["Lecture Notes in Computer Science","Automata, Languages and Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-54233-7_174.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,21]],"date-time":"2025-03-21T21:16:01Z","timestamp":1742591761000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-54233-7_174"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1991]]},"ISBN":["9783540542339","9783540475163"],"references-count":73,"URL":"https:\/\/doi.org\/10.1007\/3-540-54233-7_174","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1991]]}}}