A connected component labeling algorithm for implicitly defined domains

DOI10.2140/camcos.2023.18.29zbMath1515.65054arXiv2205.14885OpenAlexW4381486440MaRDI QIDQ6161317

Robert I. Saye

Publication date: 27 June 2023

Published in: Communications in Applied Mathematics and Computational Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2205.14885

zbMATH Keywords

connected componentsBernstein polynomialslevel set methodspath connectednesssemialgebraic setsimplicitly defined domains

Mathematics Subject Classification ID

Numerical aspects of computer graphics, image analysis, and computational geometry (65D18) Geometric aspects of numerical algebraic geometry (14Q65) Computational real algebraic geometry (14Q30)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Certificates of convexity for basic semi-algebraic sets
• An efficient algorithm for range computation of polynomials using the Bernstein form
• Algorithms for polynomials in Bernstein form
• An algorithm for sums of squares of real polynomials
• Chebyshev model arithmetic for factorable functions
• Methods for bounding the range of a polynomial
• High-order quadrature on multi-component domains implicitly defined by multivariate polynomials
• Distributed Contour Trees
• High-Order Quadrature Methods for Implicitly Defined Surfaces and Volumes in Hyperrectangles
• DSOS and SDSOS Optimization: More Tractable Alternatives to Sum of Squares and Semidefinite Optimization