Search Results - ACM F.2.2 Nonnumerical Algorithms and Problems

  • Showing 1 - 4 results of 4
Refine Results
  1. 1
    Cover Image

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

    ISSN: 0167-7055, 1467-8659
    Published: Oxford Blackwell Publishing Ltd 01.06.2014
    Published in Computer graphics forum (01.06.2014)
    “… The algorithm provides a global pairing scheme for mandatory critical points which is used to construct mandatory join and split trees…”
    Get full text
    Journal Article
    Save to List
    Saved in:
  2. 2
    Cover Image

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

    ISSN: 0167-7055, 1467-8659, 1467-8659
    Published: Oxford, UK Blackwell Publishing Ltd 01.08.2013
    Published in Computer graphics forum (01.08.2013)
    “…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…”
    Get full text
    Journal Article
    Save to List
    Saved in:
  3. 3
    Cover Image

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

    ISSN: 0167-7055, 1467-8659
    Published: Oxford Blackwell Publishing Ltd 01.08.2016
    Published in Computer graphics forum (01.08.2016)
    “… We describe a subdivision algorithm for computing a clustered ε‐isotopic approximation of the minimization diagram of X…”
    Get full text
    Journal Article
    Save to List
    Saved in:
  4. 4
    Cover Image

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

    ISSN: 2575-5528
    Published: ACM 01.07.2016
    “… ideals.Categories and Subject Descriptors F.2.2 [Analysis of Algorithms and Problem Complexity]: Nonnumerical Algorithms and Problems…”
    Get full text
    Conference Proceeding
    Save to List
    Saved in:

Search Tools: