Suchergebnisse - ACM F.2.2 Nonnumerical Algorithms and Problems

Mandatory Critical Points of 2D Uncertain Scalar Fields von Günther, David, Salmon, Joseph, Tierny, Julien

“… The algorithm provides a global pairing scheme for mandatory critical points which is used to construct mandatory join and split trees …”
Volltext

Fast and Robust Approximation of Smallest Enclosing Balls in Arbitrary Dimensions von Larsson, Thomas, Källberg, Linus

“… In this paper, an algorithm is introduced that computes an arbitrarily fine approximation of the smallest enclosing ball of a point set in any dimension …”
Volltext

Planar Minimization Diagrams via Subdivision with Applications to Anisotropic Voronoi Diagrams von Bennett, H., Papadopoulou, E., Yap, C.

“… We describe a subdivision algorithm for computing a clustered ε‐isotopic approximation of the minimization diagram of X …”
Volltext

The Complexity of Coverability in ν-Petri Nets von Lazic, Ranko, Schmitz, Sylvain

“… ideals.Categories and Subject Descriptors F.2.2 [Analysis of Algorithms and Problem Complexity]: Nonnumerical Algorithms and Problems …”
Volltext