Skip header Section
Skip Bibliometrics Section
Data structures and algorithms 3: multi-dimensional searching and computational geometryOctober 1984
- Author:
- Kurt Mehlhorn
Abstract
No abstract available.
Cited By
- Kuo A, Chen H, Tang L, Ku W and Qin X (2023). ProbSky: Efficient Computation of Probabilistic Skyline Queries Over Distributed Data, IEEE Transactions on Knowledge and Data Engineering, 35:5, (5173-5186), Online publication date: 1-May-2023.
- Da Lozzo G, Di Battista G, Frati F, Patrignani M and Roselli V (2020). Upward Planar Morphs, Algorithmica, 82:10, (2985-3017), Online publication date: 1-Oct-2020.
- Rahul S (2020). An (Almost) Optimal Solution for Orthogonal Point Enclosure Query in ℝ3, Mathematics of Operations Research, 45:1, (369-383), Online publication date: 1-Feb-2020.
- Ferrada H, Navarro C and Hitschfeld N (2020). A filtering technique for fast Convex Hull construction in R 2 , Journal of Computational and Applied Mathematics, 364:C, Online publication date: 15-Jan-2020.
- Floderus P, Jansson J, Levcopoulos C, Lingas A and Sledneu D (2018). 3D Rectangulations and Geometric Matrix Multiplication, Algorithmica, 80:1, (136-154), Online publication date: 1-Jan-2018.
- Gavryushkin A, Khoussainov B, Kokho M and Liu J (2016). Dynamic Algorithms for Multimachine Interval Scheduling Through Analysis of Idle Intervals, Algorithmica, 76:4, (1160-1180), Online publication date: 1-Dec-2016.
Yu W, Zhao H, Zhang W and Jin Z A Feature-Driven Approach to Automated Class Diagram Construction Proceedings of the 7th Asia-Pacific Symposium on Internetware, (203-211)- Rahul S Improved bounds for orthogonal point enclosure query and point location in orthogonal subdivisions in R3 Proceedings of the twenty-sixth annual ACM-SIAM symposium on Discrete algorithms, (200-211)
- Frati F, Gudmundsson J and Welzl E (2014). On the number of upward planar orientations of maximal planar graphs, Theoretical Computer Science, 544, (32-59), Online publication date: 1-Aug-2014.
- Bitner S and Daescu O (2012). Minimum-sum dipolar spanning tree in R 3, Computational Geometry: Theory and Applications, 45:9, (476-481), Online publication date: 1-Nov-2012.
- Sra S and Cherian A Generalized dictionary learning for symmetric positive definite matrices with application to nearest neighbor retrieval Proceedings of the 2011 European conference on Machine learning and knowledge discovery in databases - Volume Part III, (318-332)
- Sra S and Cherian A Generalized Dictionary Learning for symmetric positive definite matrices with application to Nearest Neighbor retrieval Proceedings of the 2011th European Conference on Machine Learning and Knowledge Discovery in Databases - Volume Part III, (318-332)
- Aronov B, Dulieu M and Hurtado F (2011). Witness (Delaunay) graphs, Computational Geometry: Theory and Applications, 44:6-7, (329-344), Online publication date: 1-Aug-2011.
- Mahapatra P, Karmakar A, Das S and Goswami P k-enclosing axis-parallel square Proceedings of the 2011 international conference on Computational science and its applications - Volume Part III, (84-93)
- Chan T Three problems about dynamic convex hulls Proceedings of the twenty-seventh annual symposium on Computational geometry, (27-36)
- Atallah M, Qi Y and Yuan H (2011). Asymptotically efficient algorithms for skyline probabilities of uncertain data, ACM Transactions on Database Systems, 36:2, (1-28), Online publication date: 1-May-2011.
- Bekos M, Kaufmann M, Papadopoulos D and Symvonis A Combining traditional map labeling with boundary labeling Proceedings of the 37th international conference on Current trends in theory and practice of computer science, (111-122)
- Dickerson M, Eppstein D and Goodrich M Cloning Voronoi diagrams via retroactive data structures Proceedings of the 18th annual European conference on Algorithms: Part I, (362-373)
- Chan T (2010). A dynamic data structure for 3-D convex hulls and 2-D nearest neighbor queries, Journal of the ACM, 57:3, (1-15), Online publication date: 1-Mar-2010.
- Italiano G and Raman R Topics in data structures Algorithms and theory of computation handbook, (5-5)
- Holzer M, Schulz F, Wagner D, Prasinos G and Zaroliagis C (2010). Engineering planar separator algorithms, ACM Journal of Experimental Algorithmics, 14, (1.5-1.31), Online publication date: 1-Dec-2009.
- Atallah M and Qi Y Computing all skyline probabilities for uncertain data Proceedings of the twenty-eighth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems, (279-287)
- Abam M and de Berg M Kinetic spanners in Rd Proceedings of the twenty-fifth annual symposium on Computational geometry, (43-50)
- Dietzfelbinger M and Schellbach U On risks of using cuckoo hashing with simple universal hash classes Proceedings of the twentieth annual ACM-SIAM symposium on Discrete algorithms, (795-804)
- Zadravec M, Brodnik A, Mannila M, Wanne M and alik B (2008). A practical approach to the 2D incremental nearest-point problem suitable for different point distributions, Pattern Recognition, 41:2, (646-653), Online publication date: 1-Feb-2008.
- Fredriksson K, Mäkinen V and Navarro G (2007). Rotation and lighting invariant template matching, Information and Computation, 205:7, (1096-1113), Online publication date: 1-Jul-2007.
- Nekrich Y A data structure for multi-dimensional range reporting Proceedings of the twenty-third annual symposium on Computational geometry, (344-353)
- Steffen P and Giegerich R (2006). Table design in dynamic programming, Information and Computation, 204:9, (1325-1345), Online publication date: 1-Sep-2006.
- Bender M, Farach-Colton M and Kuszmaul B Cache-oblivious string B-trees Proceedings of the twenty-fifth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems, (233-242)
- Chan T A dynamic data structure for 3-d convex hulls and 2-d nearest neighbor queries Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm, (1196-1202)
- Bekos M, Kaufmann M, Potika K and Symvonis A Boundary labelling of optimal total leader length Proceedings of the 10th Panhellenic conference on Advances in Informatics, (80-89)
- Nekrich Y Space efficient dynamic orthogonal range reporting Proceedings of the twenty-first annual symposium on Computational geometry, (306-313)
- Lin X, Yuan Y, Wang W and Lu H Stabbing the Sky Proceedings of the 21st International Conference on Data Engineering, (502-513)
- Howarth R (2005). Spatial Models for Wide-Area Visual Surveillance, Artificial Intelligence Review, 23:2, (97-155), Online publication date: 1-Apr-2005.
- Zhang D and Tsotras J (2005). Optimizing spatial Min/Max aggregations, The VLDB Journal — The International Journal on Very Large Data Bases, 14:2, (170-181), Online publication date: 1-Apr-2005.
- Lu H and Sahni S (2004). O(\log n) Dynamic Router-Tables for Prefixes and Ranges, IEEE Transactions on Computers, 53:10, (1217-1230), Online publication date: 1-Oct-2004.
- Kaplan H, Molad E and Tarjan R Dynamic rectangular intersection with priorities Proceedings of the thirty-fifth annual ACM symposium on Theory of computing, (639-648)
- Makris C, Tsakalidis A and Tsichlas K (2003). Reflected min-max heaps, Information Processing Letters, 86:4, (209-214), Online publication date: 31-May-2003.
- de Berg M, Gudmundsson J, Hammar M and Overmars M (2003). On R-trees with low query complexity, Computational Geometry: Theory and Applications, 24:3, (179-195), Online publication date: 1-Apr-2003.
- Rosenberg A (2003). Accountable Web-Computing, IEEE Transactions on Parallel and Distributed Systems, 14:2, (97-106), Online publication date: 1-Feb-2003.
- Mortensen C Fully-dynamic two dimensional orthogonal range and line segment intersection reporting in logarithmic time Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms, (618-627)
- Lee I, Park K, Choi Y and Chung S (2003). A Simple and Scalable Algorithm for the IP Address Lookup Problem, Fundamenta Informaticae, 56:1-2, (181-190), Online publication date: 1-Jan-2003.
- Mehlhorn K and Schäfer G (2002). Implementation of O(nmlogn) weighted matchings in general graphs, ACM Journal of Experimental Algorithmics, 7, (4), Online publication date: 31-Dec-2003.
- Agarwal P and Sharir M Pseudo-line arrangements Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms, (800-809)
- Chan T Semi-online maintenance of geometric optima and measures Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms, (474-483)
- Bozanis P A new randomized data structure for the 11/2-dimensional range query problem Proceedings of the 8th Panhellenic conference on Informatics, (440-452)
- Bartolini I, Ciaccia P and Waas F FeedbackBypass Proceedings of the 27th International Conference on Very Large Data Bases, (201-210)
- Chávez E, Navarro G, Baeza-Yates R and Marroquín J (2001). Searching in metric spaces, ACM Computing Surveys, 33:3, (273-321), Online publication date: 1-Sep-2001.
- Alstrup S, Brodal G and Rauhe T Optimal static range reporting in one dimension Proceedings of the thirty-third annual ACM symposium on Theory of computing, (476-482)
- Chazelle B and Liu D Lower bounds for intersection searching and fractional cascading in higher dimension Proceedings of the thirty-third annual ACM symposium on Theory of computing, (322-329)
- Spence A and Li Z Parallel processing for 2-1/2D machining simulation Proceedings of the sixth ACM symposium on Solid modeling and applications, (140-148)
- Chan T (2001). Dynamic planar convex hull operations in near-logarithmic amortized time, Journal of the ACM, 48:1, (1-12), Online publication date: 1-Jan-2001.
- Demaine E, López-Ortiz A and Munro J Adaptive set intersections, unions, and differences Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms, (743-752)
- Agarwal P and Procopiuc C Approximation algorithms for projective clustering Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms, (538-547)
- Koudas N and Sevcik K (2000). High Dimensional Similarity Joins, IEEE Transactions on Knowledge and Data Engineering, 12:1, (3-18), Online publication date: 1-Jan-2000.
- Vasilis D, Christos M and Spiros S A provably efficient computational model for approximate spatiotemporal retrieval Proceedings of the 7th ACM international symposium on Advances in geographic information systems, (40-46)
- Chan T Dynamic Planar Convex Hull Operations in Near-Logarithmic Amortized Time Proceedings of the 40th Annual Symposium on Foundations of Computer Science
- Ferragina P, Muthukrishnan S and de Berg M Multi-method dispatching Proceedings of the thirty-first annual ACM symposium on Theory of Computing, (483-491)
- Bjørner D and Cuéllar J (1999). Software engineering education, Annals of Software Engineering, 6:1-4, (365-409), Online publication date: 1-Apr-1999.
- Koutsoupias E and Taylor D Indexing schemes for random points Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms, (596-602)
- Tamassia R (1998). Constraints in Graph Drawing Algorithms, Constraints, 3:1, (87-120), Online publication date: 1-Apr-1998.
- Suri S, Hubbard P and Hughes J Collision detection in aspect and scale bounded polyhedra Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms, (127-136)
- Kumar A, Tsotras V and Faloutsos C (1998). Designing Access Methods for Bitemporal Databases, IEEE Transactions on Knowledge and Data Engineering, 10:1, (1-20), Online publication date: 1-Jan-1998.
- Barequet G (1997). Using Geometric Hashing To Repair CAD Objects, IEEE Computational Science & Engineering, 4:4, (22-28), Online publication date: 1-Oct-1997.
- Basch J, Guibas L and Zhang L Proximity problems on moving points Proceedings of the thirteenth annual symposium on Computational geometry, (344-351)
- Bremner D, Fukuda K and Marzetta A Primal-dual methods for vertex and facet enumeration (preliminary version) Proceedings of the thirteenth annual symposium on Computational geometry, (49-56)
- Ho C, Agrawal R, Megiddo N and Srikant R (1997). Range queries in OLAP data cubes, ACM SIGMOD Record, 26:2, (73-88), Online publication date: 1-Jun-1997.
- Ho C, Agrawal R, Megiddo N and Srikant R Range queries in OLAP data cubes Proceedings of the 1997 ACM SIGMOD international conference on Management of data, (73-88)
- Hellerstein J, Koutsoupias E and Papadimitriou C On the analysis of indexing schemes Proceedings of the sixteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems, (249-256)
- Chan A, Dehne F and Rau-Chaplin A Coarse Grained Parallel Next Element Search Proceedings of the 11th International Symposium on Parallel Processing
- Chazelle B (1997). Lower bounds for off-line range searching, Discrete & Computational Geometry, 17:1, (53-65), Online publication date: 1-Jan-1997.
- Bajaj C, Pascucci V and Schikore D Fast isocontouring for improved interactivity Proceedings of the 1996 symposium on Volume visualization, (39-ff.)
- Agarwal P and Kreveld M (1996). Connected component and simple polygon intersection searching, Algorithmica, 15:6, (626-660), Online publication date: 1-Jun-1996.
- Baeza-Yates R (1995). Teaching algorithms, ACM SIGACT News, 26:4, (51-59), Online publication date: 1-Dec-1995.
- Edelsbrunner H and Waupotitsch R A combinatorial approach to cartograms Proceedings of the eleventh annual symposium on Computational geometry, (98-108)
- Chazelle B Lower bounds for off-line range searching Proceedings of the twenty-seventh annual ACM symposium on Theory of computing, (733-740)
- Maass W Efficient agnostic PAC-learning with simple hypothesis Proceedings of the seventh annual conference on Computational learning theory, (67-75)
- Chazelle B and Shouraboura N Bounds on the size of tetrahedralizations Proceedings of the tenth annual symposium on Computational geometry, (231-239)
- Atallah M, Goodrich M and Ramaiyer K Biased finger trees and three-dimensional layers of maxima Proceedings of the tenth annual symposium on Computational geometry, (150-159)
- Goodrich M, Mitchell J and Orletsky M Practical methods for approximate geometric pattern matching under rigid motions Proceedings of the tenth annual symposium on Computational geometry, (103-112)
- Agarwal P, Matoušek J and Schwarzkopf O Computing many faces in arrangements of lines and segments Proceedings of the tenth annual symposium on Computational geometry, (76-84)
- Pellegrini M On point location and motion planning among simplices Proceedings of the twenty-sixth annual ACM symposium on Theory of Computing, (95-104)
- Chazelle B Computational geometry Proceedings of the twenty-sixth annual ACM symposium on Theory of Computing, (75-94)
- Gupta R, Smolka S and Bhaskar S (1994). On randomization in sequential and distributed algorithms, ACM Computing Surveys, 26:1, (7-86), Online publication date: 1-Mar-1994.
- Matias Y, Vitter J and Young N Approximate data structures with applications Proceedings of the fifth annual ACM-SIAM symposium on Discrete algorithms, (187-194)
- Agarwal P and Sharir M (1993). Applications of a new space-partitioning technique, Discrete & Computational Geometry, 9:1, (11-38), Online publication date: 1-Dec-1993.
- Brönnimann H, Chazelle B and Pach J (1993). How hard is half-space range searching?, Discrete & Computational Geometry, 10:2, (143-155), Online publication date: 1-Aug-1993.
- Dubé T Dominance range-query: the one-reporting case Proceedings of the ninth annual symposium on Computational geometry, (208-217)
- Benouamer M, Michelucci D and Peroche B Error-free boundary evaluation using lazy rational arithmetic Proceedings on the second ACM symposium on Solid modeling and applications, (115-126)
- Ramalingam G and Reps T A categorized bibliography on incremental computation Proceedings of the 20th ACM SIGPLAN-SIGACT symposium on Principles of programming languages, (502-510)
- Agarwal P and Sharir M Ray shooting amidst convex polytopes in three dimensions Proceedings of the fourth annual ACM-SIAM symposium on Discrete algorithms, (260-270)
- Dietz P, Mehlhorn K, Raman R and Uhrig C Lower bounds for set intersection queries Proceedings of the fourth annual ACM-SIAM symposium on Discrete algorithms, (194-201)
- Chazelle B, Sharir M and Welzl E (1992). Quasi-optimal upper bounds for simplex range searching and new zone theorems, Algorithmica, 8:1-6, (407-429), Online publication date: 1-Dec-1992.
- Boissonnat J and Yvinec M (1992). Probing a scene of nonconvex polyhedra, Algorithmica, 8:1-6, (321-342), Online publication date: 1-Dec-1992.
- Rüb C (1992). Line-segment intersection reporting in parallel, Algorithmica, 8:1-6, (119-144), Online publication date: 1-Dec-1992.
- Munro J, Papadakis T and Sedgewick R Deterministic skip lists Proceedings of the third annual ACM-SIAM symposium on Discrete algorithms, (367-375)
- Guibas L, Motwani R and Raghavan P The robot localization problem in two dimensions Proceedings of the third annual ACM-SIAM symposium on Discrete algorithms, (259-268)
- Baumgarten H, Jung H and Mehlhorn K Dynamic point location in general subdivisions Proceedings of the third annual ACM-SIAM symposium on Discrete algorithms, (250-258)
- Tsay J Searching tree structures on a mesh of processors Proceedings of the third annual ACM-SIAM symposium on Discrete algorithms, (114-123)
- Brönnimann H and Chazelle B How hard is halfspace range searching? Proceedings of the eighth annual symposium on Computational geometry, (271-275)
- Matoušek J and Schwarzkopf O Linear optimization queries Proceedings of the eighth annual symposium on Computational geometry, (16-25)
- Ryan S (1992). Linear control flow analysis, ACM SIGPLAN Notices, 27:2, (57-64), Online publication date: 1-Feb-1992.
- Straforini M, Coelho C, Campani M and Torre V (1992). The Recovery and Understanding of a Line Drawing from Indoor Scenes, IEEE Transactions on Pattern Analysis and Machine Intelligence, 14:2, (298-303), Online publication date: 1-Feb-1992.
- Turk G (1991). Generating textures on arbitrary surfaces using reaction-diffusion, ACM SIGGRAPH Computer Graphics, 25:4, (289-298), Online publication date: 2-Jul-1991.
- Turk G Generating textures on arbitrary surfaces using reaction-diffusion Proceedings of the 18th annual conference on Computer graphics and interactive techniques, (289-298)
- de Berg M, van Kreveld M and Nilsson B Shortest path queries in rectilinear worlds of higher dimension (extended abstract) Proceedings of the seventh annual symposium on Computational geometry, (51-60)
- Gigus Z, Canny J and Seidel R (1991). Efficiently Computing and Representing Aspect Graphs of Polyhedral Objects, IEEE Transactions on Pattern Analysis and Machine Intelligence, 13:6, (542-551), Online publication date: 1-Jun-1991.
- Agarwal P and Sharir M Planar geometric location problems and maintaining the width of a planar set Proceedings of the second annual ACM-SIAM symposium on Discrete algorithms, (449-458)
- Schiele W, Krüger T, Just K and Kirsch F A gridless router for industrial design rules Proceedings of the 27th ACM/IEEE Design Automation Conference, (626-631)
- Dobkin D and Souvaine D (1990). Computational geometry in a curved world, Algorithmica, 5:1-4, (421-457), Online publication date: 1-Jun-1990.
- Blankenagel G and Güting R (1990). Internal and external algorithms for the points-in-regions problem—the inside join of geo-relational algebra, Algorithmica, 5:1-4, (251-276), Online publication date: 1-Jun-1990.
- Huttenlocher D and Kedem K Computing the minimum Hausdorff distance for point sets under translation Proceedings of the sixth annual symposium on Computational geometry, (340-349)
- Bentley J K-d trees for semidynamic point sets Proceedings of the sixth annual symposium on Computational geometry, (187-197)
- Chazelle B, Sharir M and Welzl E Quasi-optimal upper bounds for simplex range searching and new zone theorems Proceedings of the sixth annual symposium on Computational geometry, (23-33)
- Airey J, Rohlf J and Brooks F (1990). Towards image realism with interactive update rates in complex virtual building environments, ACM SIGGRAPH Computer Graphics, 24:2, (41-50), Online publication date: 1-Mar-1990.
- Airey J, Rohlf J and Brooks F Towards image realism with interactive update rates in complex virtual building environments Proceedings of the 1990 symposium on Interactive 3D graphics, (41-50)
- Guibas L, Hershberger J and Snoeyink J Compact interval trees Proceedings of the first annual ACM-SIAM symposium on Discrete algorithms, (169-178)
- Hoffmann C, Hopcroft J and Karasick M (1989). Robust Set Operations on Polyhedral Solids, IEEE Computer Graphics and Applications, 9:6, (50-59), Online publication date: 1-Nov-1989.
- Chazelle B and Welzl E (1989). Quasi-optimal range searching in spaces of finite VC-dimension, Discrete & Computational Geometry, 4:5, (467-489), Online publication date: 1-Oct-1989.
- Chazelle B and Palios L Triangulating a non-convex polytype Proceedings of the fifth annual symposium on Computational geometry, (393-400)
- Boissonnat J and Yvinec M Probing a scene of non convex polyhedra Proceedings of the fifth annual symposium on Computational geometry, (237-246)
- Halperin D and Overmars M Efficient motion planning for an L-shaped object Proceedings of the fifth annual symposium on Computational geometry, (156-166)
- Chazelle B and Rosenberg B Computing partial sums in multidimensional arrays Proceedings of the fifth annual symposium on Computational geometry, (131-139)
- Alt H, Mehlhorn K, Wagener H and Welzl E (1988). Congruence, similarity, and symmetries of geometric objects, Discrete & Computational Geometry, 3:3, (237-256), Online publication date: 1-Sep-1988.
- Rao N, Vaishnavi V and Sitharama Iyengar S (1988). On the dynamization of data structures, BIT, 28:1, (37-53), Online publication date: 1-Mar-1988.
- Reif J and Sen S An efficient output-sensitive hidden surface removal algorithm and its parallelization Proceedings of the fourth annual symposium on Computational geometry, (193-200)
- Welzl E Partition trees for triangle counting and other range searching problems Proceedings of the fourth annual symposium on Computational geometry, (23-33)
- Vaidya P Geometry helps in matching Proceedings of the twentieth annual ACM symposium on Theory of computing, (422-425)
- Eastman C File organizations & incrementally specified queries Proceedings of the 10th annual international ACM SIGIR conference on Research and development in information retrieval, (217-222)
- Munro J, Overmars M and Wood D Variations on visibility Proceedings of the third annual symposium on Computational geometry, (291-299)
- Ottmann T, Theimt G and Ullrich C Numerical stability of geometric algorithms Proceedings of the third annual symposium on Computational geometry, (119-125)
- Iwano K and Steiglitz K Testing for cycles in infinite graphs with periodic structure Proceedings of the nineteenth annual ACM symposium on Theory of computing, (46-55)
- Willard D On the application of sheared retrieval to orthogonal range queries Proceedings of the second annual symposium on Computational geometry, (80-89)
- Fries O, Mehlhorn K and Näher S Dynamization of geometric data structures Proceedings of the first annual symposium on Computational geometry, (168-176)
Index Terms
- Data structures and algorithms 3: multi-dimensional searching and computational geometry
Recommendations
Computational geometry
Encyclopedia of Computer ScienceComputational geometry is the study of algorithmic problems involving geometry. Although the ruler and compass constructions of ancient Greek geometry were essentially algorithms for producing geometric objects, modern computational geometry begins with ...
Recent Advances in Computational Conformal Geometry
Proceedings of the 13th IMA International Conference on Mathematics of Surfaces XIIIComputational conformal geometry focuses on developing the computational methodologies on discrete surfaces to discover conformal geometric invariants. In this work, we briefly summarize the recent developments for methods and related applications in ...