Geometric and computational aspects of manufacturing processes

[1]  J. Sylvester.  XXVII. On Poncelet's approximate linear Valuation of surd forms , 1860 .

[2]  F. A. Valentine,et al.  Some properties of $L$-sets in the plane , 1949 .

[3]  C. O. Oakley,et al.  The Enjoyment of Mathematics. , 1957 .

[4]  C. Groenewoud,et al.  The Smallest Covering Cone or Sphere , 1963 .

[5]  Charles S. ReVelle,et al.  The Location of Emergency Service Facilities , 1971, Oper. Res..

[6]  D. Hearn,et al.  The Minimum Covering Sphere Problem , 1972 .

[7]  D. Hearn,et al.  Geometrical Solutions for Some Minimax Location Problems , 1972 .

[8]  Michael Ian Shamos,et al.  Closest-point problems , 1975, 16th Annual Symposium on Foundations of Computer Science (sfcs 1975).

[9]  Elwood S. Buffa,et al.  Graph Theory with Applications , 1977 .

[10]  F. P. Preparata,et al.  Convex hulls of finite sets of points in two and three dimensions , 1977, CACM.

[11]  David Avis,et al.  A Linear Algorithm for Finding the Convex Hull of a Simple Polygon , 1979, Inf. Process. Lett..

[12]  David E. Muller,et al.  Finding the Intersection of n Half-Spaces in Time O(n log n) , 1979, Theor. Comput. Sci..

[13]  D. T. Lee,et al.  An Optimal Algorithm for Finding the Kernel of a Polygon , 1979, JACM.

[14]  Godfried T. Toussaint,et al.  An Optimal Algorithm for Determining the Visibility of a Polygon from an Edge , 1981, IEEE Transactions on Computers.

[15]  David Avis,et al.  A Linear Algorithm for Computing the Visibility Polygon from a Point , 1981, J. Algorithms.

[16]  Franco P. Preparata,et al.  Testing a Simple Polygon for Monotonicity , 1981, Inf. Process. Lett..

[17]  Nimrod Megiddo,et al.  Linear-time algorithms for linear programming in R3 and related problems , 1982, 23rd Annual Symposium on Foundations of Computer Science (sfcs 1982).

[18]  Nimrod Megiddo,et al.  Linear-Time Algorithms for Linear Programming in R^3 and Related Problems , 1982, FOCS.

[19]  N. Megiddo.  Linear-time algorithms for linear programming in R3 and related problems , 1982, FOCS 1982.

[20]  Henryk Wozniakowski,et al.  Complexity of linear programming , 1982, Oper. Res. Lett..

[21]  Jack Sklansky,et al.  Finding the convex hull of a simple polygon , 1982, Pattern Recognit. Lett..

[22]  P. Hudson.  Mathematical Modelling of Industrial Processes , 1983 .

[23]  David G. Kirkpatrick,et al.  Optimal Search in Planar Subdivisions , 1983, SIAM J. Comput..

[24]  Johan Martinus Kluun,et al.  Injection Moulding Machines , 1984 .

[25]  D. T. Lee,et al.  On a Circle-Cover Minimization Problem , 1984, Inf. Process. Lett..

[26]  Nimrod Megiddo,et al.  Linear Programming in Linear Time When the Dimension Is Fixed , 1984, JACM.

[27]  R. Melville.  An Implementation Study of two Algorithms for the Minimum Spanning Circle Problem , 1985 .

[28]  John Tanner.  Manufacturing engineering: An introduction to the basic functions , 1985 .

[29]  Godfried T. Toussaint,et al.  Movable Separability of Sets , 1985 .

[30]  G. Toussaint,et al.  On Geometric Algorithms that use the Furthest-Point Voronoi Diagram , 1985 .

[31]  David G. Kirkpatrick,et al.  A Linear Algorithm for Determining the Separation of Convex Polyhedra , 1985, J. Algorithms.

[32]  Michael Ian Shamos,et al.  Computational geometry: an introduction , 1985 .

[33]  Robert E. Tarjan,et al.  Planar point location using persistent search trees , 1986, CACM.

[34]  Leonidas J. Guibas,et al.  Topologically sweeping an arrangement , 1986, STOC '86.

[35]  Kenneth L. Clarkson,et al.  New applications of random sampling in computational geometry , 1987, Discret. Comput. Geom..

[36]  Leonidas J. Guibas,et al.  Optimal shortest path queries in a simple polygon , 1987, SCG '87.

[37]  Eric L. Buckleitner,et al.  Molds for Reaction Injection, Structural Foam and Expandable Styrene Molding , 1987 .

[38]  J. O'Rourke.  Art gallery theorems and algorithms , 1987 .

[39]  Herbert Edelsbrunner,et al.  Algorithms in Combinatorial Geometry , 1987, EATCS Monographs in Theoretical Computer Science.

[40]  Micha Sharir,et al.  Computing the link center of a simple polygon , 1987, SCG '87.

[41]  Avraham A. Melkman,et al.  On-Line Construction of the Convex Hull of a Simple Polyline , 1987, Inf. Process. Lett..

[42]  R. Elliott.  Cast iron technology , 1988 .

[43]  Boris Aronov,et al.  The furthest-site geodesic voronoi diagram , 1993, SCG '88.

[44]  Kenneth L. Clarkson,et al.  Applications of random sampling in computational geometry, II , 1988, SCG '88.

[45]  A. A. Berk.  Computer Aided Design and Analysis for Engineers , 1988 .

[46]  M. Goodchild,et al.  Coverage problems and visibility regions on topographic surfaces , 1990 .

[47]  Micha Sharir,et al.  Computing the geodesic center of a simple polygon , 1989, Discret. Comput. Geom..

[48]  Jörg-Rüdiger Sack,et al.  An O(n log n) Algorithm for Computing a Link Center in a Simple Polygon , 1989, STACS.

[49]  Richard Cole,et al.  Visibility Problems for Polyhedral Terrains , 2018, J. Symb. Comput..

[50]  J. Ed Akin.  Computer-assisted mechanical design , 1990 .

[51]  Ketan Mulmuley.  A Fast Planar Partition Algorithm, I , 1990, J. Symb. Comput..

[52]  Subhash Suri,et al.  On some link distance problems in a simple polygon , 1990, IEEE Trans. Robotics Autom..

[53]  F. Frances Yao,et al.  Computational Geometry , 1991, Handbook of Theoretical Computer Science, Volume A: Algorithms and Complexity.

[54]  Subhash Suri,et al.  An Optimal Algorithm for Detecting Weak Visibility of a Polygon , 1990, IEEE Trans. Computers.

[55]  Raimund Seidel,et al.  Linear programming and convex hulls made easy , 1990, SCG '90.

[56]  S. Ashley,et al.  Rapid prototyping systems , 1991 .

[57]  Subir Kumar Ghosh.  Computing the Visibility Polygon from a Convex Set and Related Problems , 1991, J. Algorithms.

[58]  Bernard Chazelle.  Triangulating a simple polygon in linear time , 1991, Discret. Comput. Geom..

[59]  Jay Lee.  Analyses of visibility sites on topographic surfaces , 1991, Int. J. Geogr. Inf. Sci..

[60]  Raimund Seidel,et al.  Small-dimensional linear programming and convex hulls made easy , 1991, Discret. Comput. Geom..

[61]  Martin Held,et al.  On the Computational Geometry of Pocket Machining , 1991, Lecture Notes in Computer Science.

[62]  An optimal algorithm for intersecting line segments in the plane , 1992, JACM.

[63]  K. C. Hui,et al.  Mould design with sweep operations - a heuristic search approach , 1992, Comput. Aided Des..

[64]  Andrzej Lingas,et al.  AnO(n logn) algorithm for computing the link center of a simple polygon , 1992, Discret. Comput. Geom..

[65]  G. Toussaint,et al.  Geometric and Computational Aspects of Injection Molding , 1992 .

[66]  Prosenjit Bose,et al.  Filling Polyhedral Molds , 1993, WADS.

[67]  Jack Snoeyink,et al.  Two-dimensional Computation of the Three-dimensional Reachable Region for a Welding Head , 1993, CCCG.

[68]  Micha Sharir,et al.  Fat Triangles Determine Linearly Many Holes , 1994, SIAM J. Comput..

[69]  Timothy M. Chan.  A Simple Trapezoid Sweep Algorithm for Reporting Red/Blue Segment Intersections , 1994, CCCG.

[70]  Joseph O'Rourke,et al.  Computational Geometry in C. , 1995 .

[71]  David Rappaport,et al.  Moldable and Castable Polygons , 1994, Comput. Geom..

[72]  Prosenjit Bose,et al.  Geometric and computational aspects of gravity casting , 1995, Comput. Aided Des..