Resolving Loads with Positive Interior Stresses

DOI10.1007/978-3-642-03367-4_46zbMath1253.68341OpenAlexW1607595943MaRDI QIDQ3183482

Günter Rote, André Schulz

Publication date: 20 October 2009

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-03367-4_46

Mathematics Subject Classification ID

Computational aspects related to convexity (52B55) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A new polynomial-time algorithm for linear programming
• Pseudo-simplicial complexes from maximal locally convex functions
• A linear-time algorithm for computing the Voronoi diagram of a convex polygon
• Matrix multiplication via arithmetic progressions
• Ray shooting in polygons using geodesic triangulations
• Tutte's barycenter method applied to isotopies
• Straightening polygonal arcs and convexifying polygonal cycles
• Kinetic collision detection between two simple polygons.
• Allocating vertex \(\pi\)-guards in simple polygons via pseudo-triangulations
• Planar minimally rigid graphs and pseudo-triangulations
• A discrete Laplace-Beltrami operator for simplicial surfaces
• Realization spaces of polytopes
• Embedding 3-polytopes on a small grid
• Generalized Nested Dissection
• Applications of a Planar Separator Theorem
• Pseudotriangulations from Surfaces and a Novel Type of Edge Flip
• Acute triangulations of polygons