Journal Article10.1016/0010-4485(82)90246-9
Graphical input to a boolean solid modeller
John Woodwark,A.F. Wallis +1 more
29
TL;DR: This paper describes a technique for processing sketch input to a Boolean modeller that produces an efficient decomposition of the input profiles into half-spaces.
read more
Abstract: This paper describes a technique for processing sketch input to a Boolean modeller. It allows the user to input one or more 2D profiles which may be interpreted as plates, plates with a draft angle, or (facetted) 'turned parts'. The method produces an efficient decomposition of the input profiles into half-spaces.
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
Semi-analytic geometry with R-functions
TL;DR: The purpose of this survey is to expose the key ideas and concepts behind the theory of R-functions, explain the utility of R -functions in a broad range of applications, and to discuss selected algorithmic issues arising in connection with their use.
An efficient algorithm for finding the CSG representation of a simple polygon
David P. Dobkin,Leonidas J. Guibas,John Hershberger,Jack Snoeyink +3 more
- 01 Jun 1988
TL;DR: It is given a new proof that the interior of each simple polygon can be represented by a monotone boolean formula based on the half-planes supporting the sides of the polygon and using each such half-plane only once.
88
•Book
Some speculations on feature recognition
John Woodwark
- 01 Aug 1989
TL;DR: In this paper, the possible use of the set-theoretic (constructive solid geometry (CSG)) solid model for feature recognition is discussed, in which the geometry of an object is interpreted in terms of geometric elements of engineering significance.
86
Some speculations on feature recognition
TL;DR: Some of the problems of applying the set-theoretic (constructive solid geometry (CSG)) solid model for feature recognition to shape models are outlined, and some lines of advance are suggested.
84
Convex Decomposition of Simple Polygons
S. B. Tor,A. E. Middleditch +1 more
TL;DR: An algorithm is described for the decomposition of a bounded concave region of E2 space into a settheoretic combination of convex regions, which exhibits a linear-time complexity for regions whose difference with their convex hull consists of only convex inner regions.
83
References
Representations for Rigid Solids: Theory, Methods, and Systems
TL;DR: A coherent view, based on sound theoretical principles, of what is presently known about the representation of solids is provided by providing a simple mathematical framework for characterizing certain important aspects of representations, for example, their semantic (geometric) integrity.
Fleshing out wire frames
TL;DR: An algorithm which discovers all objects with a given wire frame is presented, which has a number of applications to mechanical design besides being of mathematical interest, has been implemented and has performed well on complex objects.
180
Decomposing a polygon into its convex parts
Bernard Chazelle,David P. Dobkin +1 more
- 30 Apr 1979
TL;DR: This work considers the problem of decomposing a simple (non-convex) polygon into the union of a minimal number of convex polygons and reaches polynomial time bounded algorithms for exact solution as well as low degree polynometric time bounded algorithm/or approximation methods.
125