THREE-DIMENSIONAL STRAIGHT SKELETONS FROM BISECTOR GRAPHS FRANZ AURENHAMMER AND GERNOT WALZL Abstract. A straight skeleton of a polygon or of a polytope is a piecewise linear skeletal structure that partitions the underl

Source URL: www.igi.tugraz.at

New Outer Bounds on the Marginal Polytope David Sontag Tommi Jaakkola Computer Science and Artificial Intelligence Laboratory Massachusetts Institute of Technology Cambridge, MA 02139

Source URL: cs.nyu.edu

MODESTO: Data-centric Analytic Optimization of Complex Stencil Programs on Heterogeneous Architectures Tobias Gysi Tobias Grosser

Source URL: www.grosser.es

• Compiler optimizations
• Computational science
• Scientific modeling
• Simulation software
• Stencil code
• Stencil
• V.
• Tessellation
• Above
• Polytope model

A Framework for Enhancing Data Reuse via Associative Reordering Kevin Stock1 Louis-No¨el Pouchet3 1

Source URL: www.grosser.es

• Software engineering
• Computer programming
• Compiler optimizations
• Computing
• Stencil code
• Loop optimization
• For loop
• Polytope model
• Optimizing compiler
• OpenMP
• Loop unrolling
• Foreach loop

Random points in halfspheres∗ Imre B´ar´any, Daniel Hug, Matthias Reitzner, Rolf Schneider Abstract A random spherical polytope Pn in a spherically convex set K ⊂ S d as considered here is the spherical convex hull

Source URL: home.mathematik.uni-freiburg.de

Polytope Offsets and Straight Skeletons in 3D ∗ Franz Aurenhammer Gernot Walzl Institute for Theoretical Computer Science

Source URL: www.igi.tugraz.at

On recovering multi-dimensional arrays in Polly Tobias Grosser, Sebastian Pop, J. Ramanujam, P. Sadayappan ETH Z¨ urich, Samsung R&D Center Austin, Louisiana State University, Ohio State University 19. January 2015

Source URL: www.grosser.es

• Software engineering
• Programming language theory
• Computer programming
• C++
• C
• Procedural programming languages
• C++ classes
• Struct
• ALGOL 68
• Polytope model
• Array data structure
• Compatibility of C and C++

Pseudo-Tetrahedral Complexes Franz Aurenhammer and Hannes Krasser∗ 1 So every d-polytope P has at least d + 1 corners. In

Source URL: www.igi.tugraz.at

GRAPHITE Two Years After First Lessons Learned From Real-World Polyhedral Compilation Konrad Trifunovic2 Albert Cohen2 David Edelsohn3 Li Feng6 Tobias Grosser5 Harsha Jagasia1 Razya Ladelsky4 Sebastian Pop1 Jan Sj¨

Source URL: www.grosser.es

• Parallel computing
• Compiler optimizations
• GNU Compiler Collection
• Task parallelism
• Static single assignment form
• Data parallelism
• Polyhedral
• Automatic parallelization
• Intermediate representation
• Polytope model

Neighborly embedded manifolds G. Kalai∗ and A. Wigderson† 1 Introduction

Source URL: www.ma.huji.ac.il

• Topology
• Mathematics
• Mathematical analysis
• Differential topology
• General topology
• Maps of manifolds
• Manifolds
• Category theory
• Embedding
• Submanifold
• Convex function
• Neighborly polytope