Computational geometry in a curved world
From MaRDI portal
Recommendations
- Decomposition and intersection of simple splinegons
- Computing shortest paths among curved obstacles in the plane
- Computing shortest paths among curved obstacles in the plane
- scientific article; zbMATH DE number 1322850
- Computational geometry on surfaces. Performing computational geometry on the cylinder, the sphere, the torus, and the cone
Cites work
- A linear algorithm for determining the separation of convex polyhedra
- A Separator Theorem for Planar Graphs
- An O(n\log \log n)-Time Algorithm for Triangulating a Simple Polygon
- An Optimal Algorithm for Finding the Kernel of a Polygon
- Convex hulls of piecewise-smooth Jordan curves
- Curve Fitting with Conic Splines
- Decomposition and intersection of simple splinegons
- Detecting the intersection of convex objects in the plane
- Fast detection of polyhedral intersection
- Finding the convex hull of a simple polygon
- scientific article; zbMATH DE number 3887061 (Why is no real title available?)
- scientific article; zbMATH DE number 4149525 (Why is no real title available?)
- scientific article; zbMATH DE number 3986609 (Why is no real title available?)
- scientific article; zbMATH DE number 4060715 (Why is no real title available?)
- scientific article; zbMATH DE number 3557226 (Why is no real title available?)
- Optimal Point Location in a Monotone Subdivision
- Optimal Search in Planar Subdivisions
- Sorting jordan sequences in linear time using level-linked search trees
- Triangulating Simple Polygons and Equivalent Problems
Cited in
(33)- An algorithmic approach to some problems in terrain navigation
- Detecting the intersection of convex objects in the plane
- Shortest curves in planar regions with curved boundary
- On determining optimal strategies in pursuit games in the plane
- Visibility graphs, dismantlability, and the cops and robbers game
- Computing grasp functions
- \(\alpha\)-kernel problem with fuzzy visibility
- On computing the convex hull of (piecewise) curved objects
- Arc fibrations of planar domains
- Representing planar domains by polar parameterizations with parabolic parameter lines
- Computing an \(L_1\) shortest path among splinegonal obstacles in the plane
- Detection and computation of conservative kernels of models consisting of freeform curves and surfaces, using inequality constraints
- A tight bound for point guards in piecewise convex art galleries
- An exact and efficient approach for computing a cell in an arrangement of quadrics
- Computational and structural advantages of circular boundary representation
- On Delaunay refinement for curved geometries
- Areas and moments of objects bounded by a closed spline curve
- Numerical Geometry of Non-Rigid Shapes
- scientific article; zbMATH DE number 1004906 (Why is no real title available?)
- An Output-Sensitive Convex Hull Algorithm for Planar Objects
- On determining optimal strategies in pursuit games in the plane
- Multi UAV coordination for tracking the dispersion of a contaminant cloud in an urban region
- A Polynomial-Time Algorithm for Computing Shortest Paths of Bounded Curvature Amidst Moderate Obstacles
- Minimizing Distance-to-Sight in Polygonal Domains
- Efficient one-sided linearization of spline geometry
- Kernel-based construction operators for Boolean sum and ruled geometry
- Voronoi-based splinegon decomposition and shortest-path tree computation
- Linear-time algorithms for weakly-monotone polygons
- Computing shortest paths amid non-overlapping weighted disks
- Guarding curvilinear art galleries with edge or mobile guards via 2-dominance of triangulation graphs
- Arc-fibration kernels of arc-spline domains
- Effective computational geometry for curves and surfaces
- Guarding curvilinear art galleries with vertex or point guards
This page was built for publication: Computational geometry in a curved world
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q911324)
