Skip to search formSkip to main contentSkip to account menu

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… 
Wikipedia (opens in a new tab)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2016
2016
In this paper the application of a general-purpose distributed Differential Evolution algorithm to range image registration is… 
2011
2011
An Unscented Information Filter (UIF) based multi-sensor fusion method for ground vehicles localization in urban environments is… 
2008
2008
A robust and fully automatic algorithm for semantic registration of laser scans of human faces is introduced. The scans are… 
2007
2007
In a range-aggegate query problem we wish to preprocess a set S of geometric objects such that given a query orthogonal range q… 
2005
2005
The paper reports on mobile robot motion estimation based on matching points from successive two-dimensional (2D) laser scans… 
2005
2005
In this paper, we make a systematic study of the global dynamical structure of the Sun–Jupiter L4 tadpole region. The results are… 
2003
2002
2002
We present an approach for computing generalized proximity information between arbitrary polygonal models using graphics hardware… 
1997
1997
In the project entitled “Computer-Assisted Collision Avoidance”, which was funded by the German Mi nistry of Education, Research…