Computing a Closest Point to a Query Hyperplane in Three and Higher Dimensions

DOI10.1007/3-540-44842-X_80MaRDI QIDQ3082972zbMATH OpenFDO

Authors Pinaki Mitra, Asish Mukhopadhyay

Publication date 18 March 2011

Published in Computational Science and Its Applications — ICCSA 2003 (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/3-540-44842-X_80

Mathematics Subject Classification ID

Computational aspects related to convexity (52B55) Numerical aspects of computer graphics, image analysis, and computational geometry (65D18) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Recommendations

• Approximate closest-point queries in high dimensions
• Efficiently computing the closest point to a query line
• scientific article; zbMATH DE number 1424308
• A Randomized Algorithm for Closest-Point Queries
• Computing closest and farthest points for a query segment
• Farthest-point queries with geometric and combinatorial constraints
• Farthest-Point Queries with Geometric and Combinatorial Constraints
• Closest point search in lattices

Cited in

(2)

• Efficiently computing the closest point to a query line
• An (Almost) Optimal Solution for Orthogonal Point Enclosure Query in ℝ³

This page was built for publication: Computing a Closest Point to a Query Hyperplane in Three and Higher Dimensions

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3082972)