Separator based parallel divide and conquer in computational geometry

1992 ◽  
Author(s):  
Alan M. Frieze ◽  
Gary L. Miller ◽  
Shang-Hua Teng
Keyword(s):  
Computational Geometry ◽  
Divide And Conquer

scholarly journals Closest Pair Algorithms in 2D space,a commentary on complexity and reductions

2022 ◽  
Vol 10 (01) ◽  
Author(s):  
Anand Sunder ◽  
Keyword(s):  
Computational Geometry ◽  
Divide And Conquer ◽  
Brute Force ◽  
Worst Case ◽  
Closest Pair ◽  
Least Area ◽  
2D Space

One of the most challenging problems in computational geometry is closest pair of points given n points. Brute force algorithms[1] and Divide and conquer[1] have been verified and the lowest complexity of attributed to latter class of algorithms, with worst case being for the former being . We propose a method of partitioning the set of n-points based on the least area rectangle that can circumscribe these points

Simultaneous Localization and Sampled Environment Mapping Based on a Divide-and-conquer Ideology

2011 ◽  
Vol 36 (12) ◽  
pp. 1697-1705 ◽  
Author(s):  
Rong-Chuan SUN ◽  
Shu-Gen MA ◽  
Bin LI ◽  
Ming-Hui WANG ◽  
Yue-Chao WANG
Keyword(s):  
Divide And Conquer

A Divide-and-Conquer Strategy for the Prediction of Protein Contact Map

2014 ◽  
Vol 12 (2) ◽  
pp. 124-130 ◽  
Author(s):  
Cosme Santiesteban-Toca ◽  
Gerardo Casanola-Martin ◽  
Jesus Aguilar-Ruiz
Keyword(s):  
Divide And Conquer ◽  
Contact Map
Sign in / Sign up

Export Citation Format

Share Document