Implementation and Parallelization of a Reverse-Search Algorithm for Minkowski Sums

No abstract is available for this paper.

• Publication year

  2010

• Venue

  Workshop on Algorithm Engineering and Experimentation

• Publication date

  2010-01-16

• Fields of study

  Mathematics, Computer Science

• Identifiers
  DOI 10.1137/1.9781611972900.4
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• Partially Observable Markov Decision Processes: A Geometric Technique and Analysis

  2010cited by this paper
• Arrangements of geodesic arcs on the sphere

  2008cited by this paper
• On the hardness of minkowski addition and related operations

  2007cited by this paper
• Advanced Optimization Laboratory Title : Hyperplane Arrangements with Large Average Diameter

  2007cited by this paper
• Exact and efficient construction of Minkowski sums of convex polyhedra with applications

  2006cited by this paper
• From the zonotope construction to the Minkowski addition of convex polytopes

  2004influential reference
• Boolean Operations on 3D Selective Nef Complexes: Data Structure, Algorithms, and Implementation

  2003cited by this paper
• TOPCOM: Triangulations of Point Configurations and Oriented Matroids

  2002cited by this paper
• The parallel search bench ZRAM and its applications

  1999cited by this paper
• Reverse Search for Enumeration

  1996cited by this paper
• Minkowski Addition of Polytopes: Computational Complexity and Applications to Gröbner Basis

  1993cited by this paper
• An algorithm for planning collision-free paths among polyhedral obstacles

  1979cited by this paper

• : a light

  2023cites this paper
• Dynamic Learning and Decision-Making by the Aid of Basis Weight Frontiers1

  2021cites this paper
• Practical Volume Estimation of Zonotopes by a New Annealing Schedule for Cooling Convex Bodies

  2020cites this paper
• A New Methodology for the Study of Dynamic Decision-Making with a Continuous Unknown Parameter

  2020cites this paper
• Mathematical Software – ICMS 2020: 7th International Conference, Braunschweig, Germany, July 13–16, 2020, Proceedings

  2020cites this paper
• Efficient Community Detection for Large Scale Networks via Sub-sampling

  2018cites this paper
• Generation of low-dimensional capacity constraints for parallel machines

  2017influential citation
• Parallel Enumeration of Triangulations

  2017cites this paper
• mts: a light framework for parallelizing tree search codes

  2017cites this paper
• Aeroelastic flutter analysis considering modeling uncertainties

  2017cites this paper
• Estimating Community Structure in Networks by Spectral Methods

  2016cites this paper
• A randomized algorithm for enumerating zonotope vertices

  2016cites this paper
• mplrs: A scalable parallel vertex/facet enumeration code

  2015influential citation
• The Geometry of Statistical Machine Translation

  2015cites this paper
• OPTIMIZATION VIA LOW-RANK APPROXIMATION FOR COMMUNITY DETECTION IN NETWORKS

  2015cites this paper
• Optimization via Low-rank Approximation for Community Detection in Networks

  2014cites this paper
• A Portable Parallel Implementation of the lrs Vertex Enumeration Code

  2013influential citation
• Basis Enumeration of Hyperplane Arrangements Up to Symmetries

  2012cites this paper
• Maximum lilkelihood estimation in the $\beta$-model

  2011cites this paper