Abstract
We introduce interval scalar projection operation with tight interval enclosure. Our approach relies on the solution to non-convex optimization problem. We present an improved algorithm for computing interval scalar projection for 2-dimensional box intervals and compare to a simple algorithm based on natural interval extension method. Applications include automated verification of properties of geometric algorithms and computing Voronoi diagrams over inexact input data.
Author supplied keywords
Cite
CITATION STYLE
Dobrowolski, T. (2017). Improving enclosure of interval scalar projection operation. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 10693 LNCS, pp. 137–146). Springer Verlag. https://doi.org/10.1007/978-3-319-72453-9_10
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
