Geometric Computations on Indecisive Points
From MaRDI portal
Recommendations
- Towards exact geometric computation
- scientific article; zbMATH DE number 1003230
- New Computational Paradigms
- scientific article; zbMATH DE number 3995937
- scientific article; zbMATH DE number 1985283
- Geometric algorithms for discreteness and faithfulness
- Some numerical problems in discrete geometry
- Abstract Geometrical Computation and Computable Analysis
- scientific article; zbMATH DE number 5165709
Cited in
(15)- Largest and smallest area triangles on imprecise points
- Bichromatic 2-center of pairs of points
- Expected computations on color spanning sets
- Region-based approximation of probability distributions (for visibility between imprecise points among obstacles)
- Computing the center of uncertain points on tree networks
- Computing the Expected Value and Variance of Geometric Measures
- Approximating the distribution of the median and other robust estimators on uncertain data
- The Most Likely Object to be Seen Through a Window
- Data imprecision under \(\lambda\)-geometry model
- Computing the center of uncertain points on tree networks
- Point set distance and orthogonal range problems with dependent geometric uncertainties
- Weak Rational Computing for Digital Geometry
- Fréchet Distance for Uncertain Curves
- Fréchet distance for uncertain curves
- The farthest color Voronoi diagram in the plane
This page was built for publication: Geometric Computations on Indecisive Points
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5199271)