Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 233,333,189 papers from all fields of science
Search
Sign In
Create Free Account
Proximity problems
Known as:
Closest point problems
, Closest points
, Proximity problem
Proximity problems is a class of problems in computational geometry which involve estimation of distances between geometric objects. A subset of…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
11 relations
Computational complexity theory
Computational geometry
Convex hull
Delaunay triangulation
Expand
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2016
2016
Метод оценки неопределённостей пространственного сопряжения высокоточных деталей с использованием оптических измерений
M. Bolotov
,
V. А. Pechenin
,
S. P. Murzin
2016
Corpus ID: 125334146
This paper presents a method for estimating the uncertainty of spatial mating of high-precision parts using optical measurements…
Expand
2007
2007
Range-Aggregate Proximity Queries
Prosenjit Gupta
2007
Corpus ID: 13587587
In a range-aggegate query problem we wish to preprocess a set S of geometric objects such that given a query orthogonal range q…
Expand
2006
2006
Isoradius Contours: New Representations and Techniques for 3D Face Registration and Matching
Nick E. Pears
,
T. Heseltine
3D Data Processing Visualization and Transmission
2006
Corpus ID: 14387598
We propose a technique for 3D face registration and matching using a novel representation called "isoradius contours". An…
Expand
2005
2005
Cricket as a Positioning System for Control Applications
Aleksandr Kushleyev
,
T. Young
2005
Corpus ID: 6123320
2005
2005
Genetic and ICP Laser Point Matching for 2 D Mobile Robot Motion Estimation ∗
Jorge L. Martínez
,
Javier González
,
J. Morales
,
A. Mandow
,
A. García-Cerezo
2005
Corpus ID: 14566814
The paper reports on mobile robot motion estimation based on matching points from successive two-dimensional (2D) laser scans…
Expand
2005
2005
The Observed Trojans and the Global Dynamics Around The Lagrangian Points of the Sun–Jupiter System
P. Robutel
,
F. Gabern
,
À. Jorba
2005
Corpus ID: 5759776
In this paper, we make a systematic study of the global dynamical structure of the Sun–Jupiter L4 tadpole region. The results are…
Expand
2003
2003
The "all-pairs closest points" problem
W. Mahoney
2003
Corpus ID: 126150845
2002
2002
Fast 3D Geometric Proximity Queries between Rigid and Deformable Models Using Graphics Hardware Acceleration
K. E. Hoff
,
Andrew Zaferakis
,
Ming C Lin
,
Dinesh Manocha
2002
Corpus ID: 5138050
We present an approach for computing generalized proximity information between arbitrary polygonal models using graphics hardware…
Expand
1997
1997
Computer-assisted collision avoidance using ARPA and ECDIS
J. Froese
,
S. Mathes
1997
Corpus ID: 127889503
In the project entitled “Computer-Assisted Collision Avoidance”, which was funded by the German Mi nistry of Education, Research…
Expand
1976
1976
Divide and conquer algorithms for closest point problems in multidimensional space.
J. Bentley
1976
Corpus ID: 60762511
By clicking accept or continuing to use the site, you agree to the terms outlined in our
Privacy Policy
(opens in a new tab)
,
Terms of Service
(opens in a new tab)
, and
Dataset License
(opens in a new tab)
ACCEPT & CONTINUE