scientific article; zbMATH DE number 1786519
From MaRDI portal
Publication:4547814
zbMath0998.52013MaRDI QIDQ4547814
Publication date: 21 August 2002
Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2098/20980252
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Computational aspects related to convexity (52B55) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)
Related Items (9)
Preclustering algorithms for imprecise points ⋮ Largest and smallest convex hulls for imprecise points ⋮ On some geometric problems of color-spanning sets ⋮ Convex hulls under uncertainty ⋮ Region-based approximation of probability distributions (for visibility between imprecise points among obstacles) ⋮ Preprocessing imprecise points for Delaunay triangulation: simplified and extended ⋮ Largest and smallest area triangles on imprecise points ⋮ The directed Hausdorff distance between imprecise point sets ⋮ Largest bounding box, smallest diameter, and related problems on imprecise points
This page was built for publication: