Live briefing
Everything about Proximity problems
Distance estimation problems in computational geometry
Proximity problems is a class of problems in computational geometry which involve estimation of distances between geometric objects. Wikipedia →
🧭 Start here: a 6-step reading path
- Read the overview: Proximity problemsA 5-minute orientation
- Skim a recent paper: Casino proximity, visit frequency, and gambling problemsInfluential work since 2022
- Pick up a classic book: Localization algorithms and strategies for wireless sensor networksThe most-reprinted book on the subject
- Read the landmark paper: Optimal approximations by piecewise smooth functions and associated variational problemsCited 4,298 times
- Go sideways: Computational geometryA closely related topic
- Go sideways: List of combinatorial computational geometry topicsA closely related topic
📖 Definitions
No dictionary entry for this exact phrase.
🗂️ The subject at a glance
🏆 Landmark papers (most cited)
Optimal approximations by piecewise smooth functions and associated variational problems
Using Karush-Kuhn-Tucker proximity measure for solving bilevel optimization problems
A Pairwise Proximity Learning-Based Ant Colony Algorithm for Dynamic Vehicle Routing Problems
Hierarchical Clustering Problems and Analysis of Fuzzy Proximity Relation on Granular Space
Improving the reconstruction capabilities in inverse scattering problems by exploitation of close-proximity setups
Proximity approach to extension problems
Algorithms for proximity problems in higher dimensions
Open Innovation for Wicked Problems: Using Proximity to Overcome Barriers
🆕 Influential since 2022
Casino proximity, visit frequency, and gambling problems
Reoptimisation strategies for dynamic vehicle routing problems with proximity-dependent nodes
Inertial Projection Algorithm for Solving Split Best Proximity Point and Mixed Equilibrium Problems in Hilbert Spaces
Solvability of a system of nonlinear mixed problems by applying a best proximity point theorem
Research of the Solutions Proximity of Linearized and Nonlinear Problems of the Biogeochemical Process Dynamics in Coastal Systems
📚 Books worth reading
Localization algorithms and strategies for wireless sensor networksGuoqiang Mao · 2009
Ranked by number of editions on Open Library, a rough measure of how lasting a book is.
🔗 Related topics
- 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…
- List of combinatorial computational geometry topics List of combinatorial computational geometry topics enumerates the topics of computational geometry that states problems in terms of geometric objects…
- Closest pair of points problem The closest pair of points problem or closest pair problem is a problem of computational geometry: given n {\displaystyle n} points in metric space, find…
- Nearest neighbor graph The nearest neighbor graph (NNG) is a directed graph defined for a set of points in a metric space, such as the Euclidean distance in the plane. The NNG…
- Penny graph In geometric graph theory, a penny graph is a contact graph of unit circles. It is formed from a collection of unit circles that do not cross each other…
- Geometric separator A geometric separator is a line (or another shape) that partitions a collection of geometric shapes into two subsets, such that proportion of shapes in…
- Smallest-circle problem The smallest-circle problem (also known as minimum covering circle problem, bounding circle problem, least bounding circle problem, smallest enclosing…
- Nearest neighbor search Nearest neighbor search (NNS), as a form of proximity search, is the optimization problem of finding the point in a given set that is closest (or most…