Suchergebnisse - "F.2.2 [Analysis of Algorithms and Problem Complexity]"

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

“… This paper introduces a novel, non‐local characterization of critical points and their global relation in 2D uncertain scalar fields. The characterization is …”
Volltext

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

“… Let X = {f1, …, fn} be a set of scalar functions of the form fi : ℝ2 → ℝ which satisfy some natural properties. We describe a subdivision algorithm for …”
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