Computing D-convex hulls in the plane
DOI10.1016/J.COMGEO.2008.03.003zbMATH Open1159.65022OpenAlexW2017227406MaRDI QIDQ950402FDOQ950402
Publication date: 22 October 2008
Published in: Computational Geometry (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.comgeo.2008.03.003
algorithmnumerical exampleseparate convexityrank-one convexity\(D\)-convex hull\(D\)-convexityseparately convex hull
Convex sets in (2) dimensions (including convex curves) (52A10) Numerical aspects of computer graphics, image analysis, and computational geometry (65D18)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- On functional separately convex hulls
- On directional convexity
- Variational methods for crystalline microstructure. Analysis and computation
- Studying Nonlinear pde by Geometry in Matrix Space
- The computational geometry algorithms library CGAL
- Fundamentals of restricted-orientation convexity
- Title not available (Why is that?)
- Bi-convexity and bi-martingales
- Polycrystalline configurations that maximize electrical resistivity
- Erratum: ``Rank-one convex hulls in \(\mathbb R^{2\times2}\)
- An algebraic characterization of quasi-convex functions
- Generalized halfspaces in restricted-orientation convexity
- On the local structure of rank-one convex hulls
Cited In (21)
- Title not available (Why is that?)
- New directions in real algebraic geometry. Abstracts from the workshop held March 19--24, 2023
- Computing min-convex hulls in the affine building of \(\mathrm{SL}_d\)
- On directional convexity
- Computing Two-Dimensional Integer Hulls
- Rectilinear convex hull of points in 3D and applications
- Rectilinear Convex Hull with Minimum Area
- Another Classroom Example of Robustness Problems in Planar Convex Hull Computation
- Efficient computation of minimum-area rectilinear convex hull under rotation and generalizations
- Title not available (Why is that?)
- ALGORITHMS FOR BALL HULLS AND BALL INTERSECTIONS IN NORMED PLANES
- Synergistic solutions for merging and computing planar convex hulls
- Title not available (Why is that?)
- Separating bichromatic point sets in the plane by restricted orientation convex hulls
- Recursive Calculation of Relative Convex Hulls
- The 2+1-convex hull of a finite set
- Calculation of partially convex hulls and approximations for finite planar sets
- On the \(\mathcal{O}_\beta\)-hull of a planar point set
- The rectilinear convex hull of line segments
- A partial differential equation for the rank one convex envelope
- Towards the computation of the convex hull of a configuration from its corresponding separating matrix
Recommendations
This page was built for publication: Computing \(D\)-convex hulls in the plane
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q950402)