A Complete Implementation for Computing General Dimensional Convex Hulls

DOI10.1142/S0218195998000126MaRDI QIDQ4513209zbMATH OpenFDO

Authors Ioannis Z. Emiris

Publication date 7 November 2000

Published in International Journal of Computational Geometry & Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1142/S0218195998000126

zbMATH Keywords

robustnesspostprocessinginfinitesimal perturbationBeneath-Beyond algorithm

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Computational aspects related to convexity (52B55)

Recommendations

• scientific article; zbMATH DE number 1444287
• The quickhull algorithm for convex hulls
• How good are convex hull algorithms?
• An efficient and numerically correct algorithm for the 2D convex hull problem
• EXACT AND OPTIMAL CONVEX HULLS IN 2D

Cites work

• A General Approach to Removing Degeneracies
• A geometric consistency theorem for a symbolic perturbation scheme
• Applications of random sampling in computational geometry. II
• Applications of random sampling to on-line algorithms in computational geometry
• Computing a ham-sandwich cut in two dimensions
• Edge-skeletons in arrangements with applications
• Efficient incremental algorithms for the sparse resultant and the mixed volume
• Fast algorithms for the characteristic polynomial
• Four results on randomized incremental constructions
• Homotopies Exploiting Newton Polytopes for Solving Sparse Polynomial Systems
• Matrix multiplication via arithmetic progressions
• Multipolynomial resultant algorithms
• On the Average Number of Maxima in a Set of Vectors and Applications
• Simulation of simplicity: a technique to cope with degenerate cases in geometric algorithms
• Small-dimensional linear programming and convex hulls made easy
• Symbolic treatment of geometric degeneracies

Cited in

(7)

• Real-time fuzzy regression analysis: a convex hull approach
• Computing the sign or the value of the determinant of an integer matrix, a complexity survey.
• Rational univariate reduction via toric resultants
• Early termination in sparse interpolation algorithms
• Improved algorithms for computing determinants and resultants
• scientific article; zbMATH DE number 4085023 (Why is no real title available?)
• Efficient Predicate Evaluation Using Randomized Degeneracy Detection

Describes a project that uses

Uses Software

• Hull

This page was built for publication: A Complete Implementation for Computing General Dimensional Convex Hulls

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