Approximation algorithms for layered manufacturing

No abstract is available for this paper.

• Publication year

  2000

• Venue

  ACM-SIAM Symposium on Discrete Algorithms

• Publication date

  2000-02-01

• Fields of study

  Computer Science, Engineering

• Identifiers

  No identifiers available.

• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• Parametric polymatroid optimization and its geometric applications

  2002cited by this paper
• Point Sets with Many k-Sets

  2000cited by this paper
• Computing the width of a three-dimensional point set: an experimental study

  1999cited by this paper
• Taking a walk in a planar arrangement

  1999cited by this paper
• Dynamic planar convex hull operations in near-logarithmic amortized time

  1999influential reference
• Remarks on k-Level Algorithms in the Plane

  1999cited by this paper
• Sampling, Halfspace Range Reporting, and Construction of (<= k)-Levels in Three Dimensions.

  1998cited by this paper
• Multi-criteria geometric optimization problems in layered manufacturing

  1998cited by this paper
• Improved Bounds for Planar k -Sets and Related Problems

  1998influential reference
• Efficient approximation and optimization algorithms for computational metrology

  1997cited by this paper
• On some geometric optimization problems in layered manufacturing

  1997cited by this paper
• Contour Edge Analysis for Polyhedron Projections

  1997influential reference
• Feasibility of Design in Stereolithography

  1997cited by this paper
• Constructing levels in arrangements and higher order Voronoi diagrams

  1994cited by this paper
• Ray shooting and parametric search

  1992cited by this paper
• Lower bounds on the length of monotone paths in arrangements

  1991cited by this paper
• Approximate Levels in Line Arrangements

  1991cited by this paper
• Construction of ɛ-nets

  1990cited by this paper
• Applications of random sampling in computational geometry, II

  1988cited by this paper
• New applications of random sampling in computational geometry

  1987cited by this paper
• Constructing Belts in Two-Dimensional Arrangements with Applications

  1986influential reference
• On k-hulls and related problems

  1984cited by this paper
• The Number of Small Semispaces of a Finite Set of Points in the Plane

  1984cited by this paper
• Dissection Graphs of Planar Point Sets

  1973cited by this paper
• The notion of quantitative invisibility and the machine rendering of solids

  1967cited by this paper

• Review of heterogeneous material objects modeling in additive manufacturing

  2020cites this paper
• Orientation analysis of 3D objects toward minimal support volume in 3D-printing

  2015cites this paper
• Heuristics for estimating contact area of supports in layered manufacturing

  2007cites this paper
• DETC 2006-99666 FAST LAYERED MANUFACTURING SUPPORT VOLUME COMPUTATION ON G PUS

  2006cites this paper
• Fast Layered Manufacturing Support Volume Computation on GPUs

  2006cites this paper
• La réalisation d'œuvres d'art par prototypage rapide avec le procédé de Stratoconception®

  2005cites this paper
• Approximating contact-area of supports in layered manufacturing

  2004cites this paper
• Manufacturing processes

  2004cites this paper
• Computing An Optimal Hatching Direction In Layered Manufacturing

  2002influential citation
• DOUBLE SIDED LAYERED MANUFACTURING

  2002cites this paper
• Terrain Decomposition and Layered Manufacturing

  2001influential citation
• A decomposition-based approach to layered manufacturing

  2001cites this paper