Determining the convex hull in large multidimensional databases

DOI10.1007/3-540-44801-2_29MaRDI QIDQ4535586zbMATH OpenFDO

Authors Christian Böhm, Hans-Peter Kriegel

Publication date 16 June 2002

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2114/21140294

Mathematics Subject Classification ID

Database theory (68P15) Computing methodologies and applications (68U99)

Recommendations

• An approximate algorithm for computing multidimensional convex hulls
• Polygon queries for convex hulls of points
• Approximating largest convex hulls for imprecise points
• Approximating Largest Convex Hulls for Imprecise Points
• New efficient approximate convex hull algorithm for very large planar point sets
• A dynamic data structure for 3-D convex hulls and 2-D nearest neighbor queries
• Exact and approximate map-reduce algorithms for convex hull
• Computing D-convex hulls in the plane
• A fast approximation to a convex hull

Cited in

(6)

• Polygon queries for convex hulls of points
• Exact and approximate map-reduce algorithms for convex hull
• Sum of squares certificates for containment of \(\mathcal{H}\)-polytopes in \(\mathcal{V}\)-polytopes
• Real-time fuzzy regression analysis: a convex hull approach
• Stratifying high-dimensional data based on proximity to the convex hull boundary
• Sufficient condition for injectivity of NURBS volumes by tangent cones

This page was built for publication: Determining the convex hull in large multidimensional databases

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