Geometric Computations on Indecisive Points

DOI10.1007/978-3-642-22300-6_45zbMath1342.68337OpenAlexW1547243772MaRDI QIDQ5199271

Jeff M. Phillips, Allan Grønlund Jørgensen, Maarten Löffler

Publication date: 12 August 2011

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-22300-6_45

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Related Items (14)

Computing the Center of Uncertain Points on Tree Networks ⋮ Computing the Expected Value and Variance of Geometric Measures ⋮ Convex hulls under uncertainty ⋮ Region-based approximation of probability distributions (for visibility between imprecise points among obstacles) ⋮ Fréchet Distance for Uncertain Curves ⋮ The Most Likely Object to be Seen Through a Window ⋮ Largest and smallest area triangles on imprecise points ⋮ Data imprecision under \(\lambda\)-geometry model ⋮ Computing the center of uncertain points on tree networks ⋮ Bichromatic 2-center of pairs of points ⋮ Unnamed Item ⋮ Covering uncertain points in a tree ⋮ On the expected diameter, width, and complexity of a stochastic convex hull ⋮ Expected computations on color spanning sets

This page was built for publication: Geometric Computations on Indecisive Points