Planar Point Location Revisited (A Guided Tour of a Decade of Research)

Point location is a fundamental primitive in Computational Geometry. In the plane it is stated as follows: Given a subdivision ℛ of the plane and a query point q, determine the region of ℛ containing q. We survey the work that has led to practical algorithms for the static version of the problem, and discuss current research on the corresponding dynamic algorithms.

[1]  Kurt Mehlhorn,et al.  Deterministic Simulation of Idealized Parallel Computers on More Realistic Ones , 1986, SIAM J. Comput..

[2]  Franco P. Preparata,et al.  Characterization of Associative Operations with Prefix Circuits of Constant Depth and Linear Size , 1990, SIAM J. Comput..

[3]  Mark H. Overmars,et al.  Range searching in a set of line segments , 1985, SCG '85.

[4]  R. T. Chien,et al.  ON CLUSTERING TECHNIQUES OF CITATION GRAPHS. , 1967 .

[5]  Franco P. Preparata,et al.  Some Results in the Theory of Arithmetic Codes , 1971, Inf. Control..

[6]  Kurt Mehlhorn,et al.  Area-Time Optimal VLSI Integer Multiplier with Minimum Computation Time , 1984, ICALP.

[7]  Franco P. Preparata,et al.  The cube-connected-cycles: A versatile network for parallel computation , 1979, 20th Annual Symposium on Foundations of Computer Science (sfcs 1979).

[8]  Franco P. Preparata,et al.  Optimal Three-Layer Channel Routing , 1984, IEEE Transactions on Computers.

[9]  Franco P. Preparata,et al.  Testing a Simple Polygon for Monotonicity , 1981, Inf. Process. Lett..

[10]  Franco P. Preparata,et al.  A Critique and an Appraisal of VLSI Models of Computation. , 1981 .

[11]  Franco P. Preparata,et al.  Location of a Point in a Planar Subdivision and Its Applications , 1977, SIAM J. Comput..

[12]  Franco P. Preparata,et al.  An Architecture for Bitonic Sorting with Optimal VLSI Performnance , 1984, IEEE Transactions on Computers.

[13]  Franco P. Preparata,et al.  The Medial Axis of a Simple Polygon , 1977, MFCS.

[14]  F. Preparata.  Holographic dispersal and recovery of information , 1989, IEEE Trans. Inf. Theory.

[15]  Roberto Tamassia,et al.  Fully Dynamic Point Location in a Monotone Subdivision , 1989, SIAM J. Comput..

[16]  D. T. Lee,et al.  An Optimal Algorithm for Finding the Kernel of a Polygon , 1979, JACM.

[17]  David E. Muller,et al.  Reduction of Depth of Boolean Networks with a Fan-In Constraint , 1977, IEEE Transactions on Computers.

[18]  Franco P. Preparata.  Corrigendum: A Fast Stable Sorting Algorithm with Absolutely Minimum Storage , 1976, Theor. Comput. Sci..

[19]  Franco P. Preparata,et al.  Finding the Contour of a Union of Iso-Oriented Rectangles , 1980, J. Algorithms.

[20]  David E. Muller,et al.  Finding the Intersection of two Convex Polyhedra , 1978, Theor. Comput. Sci..

[21]  V. DiEuliis,et al.  Spectrum Shaping with Alphabetic Codes with Finite Autocorrelation Sequence , 1978, IEEE Trans. Commun..

[22]  Franco P. Preparata,et al.  Approximation algorithms for convex hulls , 1982, CACM.

[23]  Herbert Edelsbrunner,et al.  Minimum Polygonal Separation , 1986, Inf. Comput..

[24]  Franco P. Preparata,et al.  Area-Time Optimal VLSI Networks for Multiplying Matrices , 1980, Inf. Process. Lett..

[25]  Franco P. Preparata,et al.  Size-time complexity of Boolean networks for prefix computations , 1987, STOC.

[26]  Richard Cole,et al.  Searching and Storing Similar Lists , 2018, J. Algorithms.

[27]  Sung-Mo Kang,et al.  Interconnection delay in very high-speed VLSI , 1988, Proceedings 1988 IEEE International Conference on Computer Design: VLSI.

[28]  Leonidas J. Guibas,et al.  Optimal Point Location in a Monotone Subdivision , 1986, SIAM J. Comput..

[29]  D. T. Lee,et al.  The All Nearest-Neighbor Problem for Convex Polygons , 1978, Inf. Process. Lett..

[30]  Franco P. Preparata,et al.  An Improved Parallel Processor Bound in Fast Matrix Inversion , 1978, Inf. Process. Lett..

[31]  David E. Muller,et al.  Finding the Intersection of n Half-Spaces in Time O(n log n) , 1979, Theor. Comput. Sci..

[32]  Herbert Edelsbrunner,et al.  Tetrahedrizing Point Sets in Three Dimensions , 1988, ISSAC.

[33]  Franco P. Preparata,et al.  The Influence of Key Length on the Area-Time Complexity of Sorting , 1985, ICALP.

[34]  Giulia Galbiati,et al.  On Permutation-Embedding Sequences , 1976 .

[35]  Franco P. Preparata.  Weight and Distance Structure of Nordstrom-Robinson Quadratic Code , 1968, Inf. Control..

[36]  M. Pracchi,et al.  A critique of network speed in VLSI models of computation , 1982, IEEE Journal of Solid-State Circuits.

[37]  Franco P. Preparata,et al.  Three layers are enough , 1982, 23rd Annual Symposium on Foundations of Computer Science (sfcs 1982).

[38]  G. Bilardi,et al.  A Minimum Area VLSI Architecture for O(logn) Time Sorting , 1983 .

[39]  Franco P. Preparata.  On the Design of Universal Boolean Functions , 1971, IEEE Transactions on Computers.

[40]  Robert E. Tarjan,et al.  Application of a Planar Separator Theorem , 1977, FOCS.

[41]  Franco P. Preparata,et al.  A Minimum Area VLSI Network for O(log n) Time Sorting , 1985, IEEE Transactions on Computers.

[42]  D. T. Lee,et al.  Parallel Batched Planar Point Location on the CCC , 1989, Inf. Process. Lett..

[43]  David E. Muller,et al.  Generation of Near-Optimal Universal Boolean Functions , 1970, J. Comput. Syst. Sci..

[44]  David E. Muller,et al.  The Time Required to Evaluate Division-Free Arithmetic Expressions , 1975, Inf. Process. Lett..

[45]  Franco P. Preparata,et al.  On the Representation of Integers in Nonadjacent Form , 1971 .

[46]  Franco P. Preparata.  Convolutional Transformation and Recovery of Binary Sequences , 1968, IEEE Transactions on Computers.

[47]  Franco P. Preparata.  On the Realizability of Special Classes of Autonomous Sequential Networks , 1965, IEEE Trans. Electron. Comput..

[48]  Robert E. Tarjan,et al.  Triangulating a Simple Polygon , 1978, Inf. Process. Lett..

[49]  Kurt Mehlhorn,et al.  Routing through a rectangle , 1986, JACM.

[50]  David E. Muller,et al.  On the Delay Required to Realize Boolean Functions , 1971, IEEE Transactions on Computers.

[51]  Franco P. Preparata.  A Class of Optimum Nonlinear Double-Error-Correcting Codes , 1968, Inf. Control..

[52]  Majid Sarrafzadeh,et al.  Compact Channel Routing of Multiterminal Nets , 1985 .

[53]  Franco P. Preparata,et al.  Deterministic P-RAM simulation with constant redundancy , 1989, SPAA '89.

[54]  Richard J. Lipton,et al.  Multidimensional Searching Problems , 1976, SIAM J. Comput..

[55]  Robert E. Tarjan,et al.  Planar point location using persistent search trees , 1986, CACM.

[56]  Mariette Yvinec,et al.  Computation of the axial view of a set of isothetic parallelepipeds , 1990, TOGS.

[57]  D. T. Lee,et al.  Euclidean shortest paths in the presence of rectilinear barriers , 1984, Networks.

[58]  Franco P. Preparata,et al.  The Densest Hemisphere Problem , 1978, Theor. Comput. Sci..

[59]  Roberto Tamassia,et al.  Fully dynamic techniques for point location and transitive closure in planar structures , 1988, [Proceedings 1988] 29th Annual Symposium on Foundations of Computer Science.

[60]  David G. Kirkpatrick,et al.  Optimal Search in Planar Subdivisions , 1983, SIAM J. Comput..

[61]  David E. Muller,et al.  Efficient Parallel Evaluation of Boolean Expressions , 1976, IEEE Transactions on Computers.

[62]  Efficient Spatial Point Location , .

[63]  D. T. Lee,et al.  Location of a point in a planar subdivision and its applications , 1976, STOC '76.

[64]  Roberto Tamassia,et al.  Dynamic Planar Point Location with Optimal Query Time , 1990, Theor. Comput. Sci..

[65]  Franco P. Preparata.  ANALYSIS OF TRAFFIC FLOW ON A SIGNALIZED ONE-WAY ARTERY , 1972 .

[66]  Franco P. Preparata,et al.  Difference-preserving codes , 1974, IEEE Trans. Inf. Theory.

[67]  Franco P. Preparata,et al.  Digital Filtering in VLSI , 1986, Aegean Workshop on Computing.

[68]  Roberto Tamassia,et al.  Dynamic Planar Point Location with Optimal Query Time , 1990, Theor. Comput. Sci..

[69]  F. Preparata.  Traffic analysis of a buffered digital data acquisition system , 1966 .

[70]  David E. Muller,et al.  Restructuring of Arithmetic Expressions For Parallel Evaluation , 1976, JACM.

[71]  Majid Sarrafzadeh,et al.  A bottom-up layout technique based on two-rectangle routing , 1987, Integr..

[72]  W. H. Kautz,et al.  State-logic relations in autonomous sequential networks , 1899, AIEE-ACM-IRE '58 (Eastern).

[73]  Kurt Mehlhorn,et al.  Data Structures and Algorithms 3: Multi-dimensional Searching and Computational Geometry , 2012, EATCS Monographs on Theoretical Computer Science.

[74]  Kurt Mehlhorn,et al.  Dynamization of geometric data structures , 1985, SCG '85.

[75]  Fabrizio Luccio,et al.  Storage for Consecutive Retrieval , 1976, Inf. Process. Lett..

[76]  Franco P. Preparata,et al.  Plane-sweep algorithms for intersecting geometric figures , 1982, CACM.

[77]  Franco P. Preparata.  Systematic construction of optimal linear recurrent codes for burst error correction , 1964 .

[78]  F. P. Preparata,et al.  Area-Time Optimal Division for T=f2( (log n)' +')* , 1987 .

[79]  Franco P. Preparata,et al.  Convolutional Transformations of Binary Sequences: Boolean Functions and Their Resynchronizing Properties , 1966, IEEE Trans. Electron. Comput..

[80]  David E. Muller,et al.  Bounds to Complexities of Networks for Sorting and for Switching , 1975, JACM.

[81]  Jean-Daniel Boissonnat,et al.  On the Boundary of a Union of Rays , 1989, STACS.

[82]  R. Tamassia.  Dynamic Data Structures for Two-Dimensional Searching , 1988 .

[83]  Franco P. Preparata.  Universal Logic Modules of a New Type , 1972, IEEE Transactions on Computers.

[84]  Robert E. Tarjan,et al.  Data structures and network algorithms , 1983, CBMS-NSF regional conference series in applied mathematics.

[85]  On multitransmission networks , 1973 .

[86]  Franco P. Preparata,et al.  An approach to artificial nonsymbolic cognition , 1972, Inf. Sci..

[87]  Franco P. Preparata,et al.  A New Approach to Planar Point Location , 1981, SIAM J. Comput..

[88]  Franco P. Preparata,et al.  Continuously Valued Logic , 1972, J. Comput. Syst. Sci..

[89]  Bernard Chazelle,et al.  Halfspace range search: an algorithmic application of K-sets , 1985, SCG '85.

[90]  Franco P. Preparata,et al.  Segments, Rectangles, Contours , 1981, J. Algorithms.

[91]  F. Preparata,et al.  Computational Complexity of Fourier Transforms over Finite Fields , 1977 .

[92]  Takao Asano,et al.  A new point-location algorithm and its practical efficiency: comparison with existing algorithms , 1984, TOGS.

[93]  Franco P. Preparata,et al.  Optimal Off-Line Detection of Repetitions in a String , 1983, Theor. Comput. Sci..

[94]  GERNOT METZE,et al.  On the Connection Assignment Problem of Diagnosable Systems , 1967, IEEE Trans. Electron. Comput..

[95]  Leonidas J. Guibas,et al.  A dichromatic framework for balanced trees , 1978, 19th Annual Symposium on Foundations of Computer Science (sfcs 1978).

[96]  Franco P. Preparata,et al.  Practical Cellular Dividers , 1990, IEEE Trans. Computers.

[97]  Franco P. Preparata,et al.  Structural Properties of the String Statistics Problem , 1985, J. Comput. Syst. Sci..