scientific article; zbMATH DE number 7779751
From MaRDI portal
Publication:6179335
DOI10.57717/cgt.v2i2.29MaRDI QIDQ6179335
Publication date: 16 December 2023
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Approximation algorithms (68W25)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Removing local extrema from imprecise terrains
- Largest and smallest convex hulls for imprecise points
- Generating realistic terrains with higher-order Delaunay triangulations
- Delaunay triangulation of imprecise points in linear time after preprocessing
- Triangulating a simple polygon in linear time
- Interior-point methods
- Largest bounding box, smallest diameter, and related problems on imprecise points
- On minimum- and maximum-weight minimum spanning trees with neighborhoods
- Flow computations on imprecise terrains
- A linear time algorithm for minimum link paths inside a simple polygon
- Optimal Binary Space Partitions in the Plane
- Optimal Shortest Path and Minimum-Link Path Queries between Two Convex Polygons inside a Simple Polygonal Obstacle
- SMOOTHING IMPRECISE 1.5D TERRAINS
- On Optimal Polyline Simplification Using the Hausdorff and Fréchet Distance
- Uncertain Curve Simplification
This page was built for publication:
