Resolving Loads with Positive Interior Stresses
From MaRDI portal
Publication:3183482
DOI10.1007/978-3-642-03367-4_46zbMATH Open1253.68341OpenAlexW1607595943MaRDI QIDQ3183482FDOQ3183482
Authors: 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
Recommendations
Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Computational aspects related to convexity (52B55)
Cites Work
- A new polynomial-time algorithm for linear programming
- Generalized Nested Dissection
- Realization spaces of polytopes
- Applications of a Planar Separator Theorem
- A linear-time algorithm for computing the Voronoi diagram of a convex polygon
- Matrix multiplication via arithmetic progressions
- A discrete Laplace-Beltrami operator for simplicial surfaces
- Pseudo-triangulations -- a survey
- Title not available (Why is that?)
- Planar minimally rigid graphs and pseudo-triangulations
- Acute triangulations of polygons
- Straightening polygonal arcs and convexifying polygonal cycles
- Ray shooting in polygons using geodesic triangulations
- Kinetic collision detection between two simple polygons.
- Pseudotriangulations from Surfaces and a Novel Type of Edge Flip
- Title not available (Why is that?)
- Embedding 3-polytopes on a small grid
- Tutte's barycenter method applied to isotopies
- Allocating vertex \(\pi\)-guards in simple polygons via pseudo-triangulations
- Pseudo-simplicial complexes from maximal locally convex functions
This page was built for publication: Resolving Loads with Positive Interior Stresses
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3183482)
