Abstract
Practical application of geometric algorithms is hindered by data imprecision. One of the primitive elements in geometry is the concept of a line. We investigate what is the right way to model imprecise lines, and present algorithms to compute bounds on the solution to linear programming or vertical extent problems on a set of imprecise lines.
Original language | English |
---|---|
Title of host publication | Proc. 24th European Workshop on Computational Geometry |
Pages | 133-136 |
Number of pages | 4 |
Publication status | Published - 2008 |
Keywords
- CG, IMP