Live briefing
Everything about Point location
Family of problems in computational geometry
The point location class of problems is a fundamental topic of computational geometry. It finds applications in areas that deal with processing geometrical data: computer graphics, geographic information systems (GIS), motion planning, and computer aided design (CAD). Wikipedia →
🧭 Start here: a 6-step reading path
- Read the overview: Point locationA 5-minute orientation
- Skim a recent paper: Bayesian location of the QCD critical point from a holographic perspectiveInfluential work since 2022
- Pick up a classic book: Creative regionsThe most-reprinted book on the subject
- Read the landmark paper: Planar point location using persistent search treesCited 300 times
- Go sideways: Polygon triangulationA closely related topic
- Go sideways: Polygon partitionA closely related topic
📖 Definitions
No dictionary entry for this exact phrase.
🗂️ The subject at a glance
🏆 Landmark papers (most cited)
Planar point location using persistent search trees
Optimal Point Location in a Monotone Subdivision
Range Searching and Point Location among Fat Objects
Point Location in Arrangements of Hyperplanes
A New Approach to Planar Point Location
The Location and Interpretation of the Bisection Point
The transfer point location problem
Point location in fat subdivisions
🆕 Influential since 2022
Bayesian location of the QCD critical point from a holographic perspective
Tea picking point detection and location based on Mask-RCNN
Accelerating Unstructured Mesh Point Location With RT Cores
Fast Location of Table Grapes Picking Point Based on Infrared Tube
Neuroanatomical characteristics of the traditional acupuncture point location ST36
📚 Books worth reading
- 📕Creative regionsPhilip Cooke, Dafna Schwartz · 2007
- 📕Growth policy in the age of high technologyJurgen Schmandt, Robert Hines Wilson · 1990
Competing for knowledgeRobert Huggins · 2007
Entrepreneurship and dynamics in the knowledge economyCharlie Karlsson, B. Johansson · 2006
Canada's Regional Innovation SystemJorge Niosi · 2005
Knowledge and InnovationHelen Brown · 2007
Acupuncture in Clinical PracticeLo Chi and Tsui Sui King Kwong · 1984
Z80 users manualJoseph J. Carr · 1980
Ranked by number of editions on Open Library, a rough measure of how lasting a book is.
🔗 Related topics
- Polygon triangulation In computational geometry, polygon triangulation is the partition of a polygonal area (simple polygon) P into a set of triangles, i.e., finding a set of…
- Polygon partition In geometry, a partition of a polygon is a set of primitive units (e.g., triangles, rectangles, etc.), which do not overlap and whose union equals the…
- Computational geometry Computational geometry is a branch of computer science devoted to the study of algorithms that can be stated in terms of geometry. Some purely geometrical…
- Polygonal chain In geometry, a polygonal chain is a connected series of line segments. More formally, a polygonal chain P is a curve specified by a sequence of points…
- Straight skeleton In geometry, a straight skeleton is a method of representing a polygon by a topological skeleton. It is similar in some ways to the medial axis but differs…
- Monotone polygon In geometry, a polygon P in the plane is called monotone with respect to a straight line L, if every line orthogonal to L intersects the boundary of P…
- David Mount David Mount is a professor at the University of Maryland, College Park department of computer science whose research is in computational geometry. Mount…
- Fractional cascading In computer science, fractional cascading is a technique to speed up a sequence of binary searches for the same value in a sequence of related data structures…