2D Arrangement

swMATH11144MaRDI QIDQ23093FDOQ23093

Author name not available (Why is that?)

Cited In (36)

• The visibility--voronoi complex and its applications
• An efficient algorithm for the stratification and triangulation of an algebraic surface
• \((\delta ,\varepsilon)\)-ball approximation of a shape: definition and complexity
• When Lipschitz Walks Your Dog: Algorithm Engineering of the Discrete Fréchet Distance under Translation
• Constructing Two-Dimensional Voronoi Diagrams via Divide-and-Conquer of Envelopes in Space
• Sweeping and Maintaining Two-Dimensional Arrangements on Surfaces: A First Step
• The visibility-Voronoi complex and its applications
• On a family of unsplit advection algorithms for volume-of-fluid methods
• Improved Implementation of Point Location in General Two-Dimensional Subdivisions
• Arrangements of geodesic arcs on the sphere
• Visualizing and exploring planar algebraic arrangements
• Optimizing the Layout of Proportional Symbol Maps: Polyhedra and Computation
• Path Planning among Movable Obstacles: A Probabilistically Complete Approach
• Exact solutions and bounds for general art gallery problems
• \(hp\)-boundary layer mesh sequences with applications to shell problems
• The complexity of the outer face in arrangements of random segments
• Title not available (Why is that?)
• Exact, robust, and efficient regularized Booleans on general 3D meshes
• Computing the arrangement of circles on a sphere, with applications in structural biology
• Polyhedral Assembly Partitioning with Infinite Translations or The Importance of Being Exact
• Robust, Generic and Efficient Construction of Envelopes of Surfaces in Three-Dimensional Spaces
• Computation of the metric average of 2D sets with piecewise linear boundaries
• A generic and flexible framework for the geometrical and topological analysis of (algebraic) surfaces
• Computing the Voronoi cells of planes, spheres and cylinders in \(\mathbb{R}^3\)
• Arrangements on parametric surfaces. II: Concretizations and applications
• CGAL Arrangements and their applications. A step-by-step guide
• Arrangements on parametric surfaces. I: General framework and infrastructure
• Design of the CGAL 3D spherical kernel and application to arrangements of circles on a sphere
• Exact geometric-topological analysis of algebraic surfaces
• Fast recognition of a digital straight line subsegment: two algorithms of logarithmic time complexity
• An experimental study of point location in planar arrangements in CGAL
• Exact Minkowski sums of polygons with holes
• Title not available (Why is that?)
• Exact symbolic-numeric computation of planar algebraic curves
• Advanced programming techniques applied to CGAL's arrangement package
• Exact and Efficient Construction of Planar Minkowski Sums Using the Convolution Method

This page was built for software: 2D Arrangement