Computing the intersection of a plane and a revolute quadric

doi:10.1016/0097-8493(94)90115-5

Computers & Graphics

Volume 18, Issue 1, January–February 1994, Pages 47-59

https://doi.org/10.1016/0097-8493(94)90115-5 Get rights and content

Abstract

A method of computing the intersection of a plane and a revolute quadric surface is presented. This problem is basic in geometric areas such as solid modeling and descriptive geometry. Our method delivers a closed form representation of the intersection conic as well as all parallel sections without added computation.

References (16)

J.K. Johnstone et al.
Computing the intersection of a plane and a natural quadric
Comp. & Graph.
(1992)
R. Bereis
Darstellende Geometrie I
(1964)
T. Schmid
S.M. Slaby
Fundamentals of Three-Dimensional Descriptive Geometry
(1966)
K. Strubecker
Vorlesungen über Darstellende Geometrie
(1958)
R.N. Goldman
Quadrics of revolution
IEEE Comp. Graph. Appl.
(1983)
J.A. Adams et al.
Descriptive Geometry and Geometric Modeling: A Basis for Design
(1988)
Q. Ding et al.
Surface Engineering Geometry for Computer Aided Design and Manufacture
(1987)

There are more references available in the full text version of this article.

Cited by (7)

Exact Representations and Geometric Queries for Lattice Structures with Quador Beams
2019, CAD Computer Aided Design
Objects with architected internal structure often consist of a lattice of beams that are interconnected at nodes. Compared to the conventional cylindrical and conical beams, quador-beams are bounded by quadrics-of-revolution. We decompose the lattice into an assembly of hubs, wherein a hub is the union of a node (ball) with the half-beams incident upon it. In this paper, we propose (1) a hybrid representation of a quador-hub (hub with quador half-beams) consisting of exact CSG + CST + Boundary models, (2) a compact data structure and associated operators to work with the hybrid representation, and (3) algorithms to perform fundamental geometric queries on the hub. We provide the operators to query the half-beams of the hub, to inquire the trimming planes of a surface, or to traverse the faces, edges and vertices of the hub. We suggest efficient algorithms, that take advantage of the hybrid representation, for geometric queries such as point membership classification, planar slicing, surface meshing, and area/volume computation. We outline a possible approach for computing exact answers to all tests that are required for computing the exact topology of the proposed representation of the hub. Finally, we show that the simplified geometry of quador hubs leads to smaller data sizes and improved performance in a commercial modeler.
QUADOR: QUADric-Of-Revolution beams for lattices
2018, CAD Computer Aided Design
Objects with designed internal structure often consist a lattice of beams, in which the surface of each beam smoothly connects two spheres, possibly of different radii. We propose a geometric model for these beams that provides a compromise between shape flexibility and ease of computation: each beam is either a single quadric of revolution (“quador”), or two smoothly connected ones (“biquador”). Quador and biquador beams can be specified using easily adjustable parameters. They simplify and accelerate several common geometric queries, including point classification, ray casting, planar slicing, and boundary evaluation. We compare quadors and biquadors with other possible beam shapes, and show that these alternatives have either reduced flexibility or increased computational cost. We advocate decomposing the lattice into an assembly of hubs, each hub defined as the union of a sphere with the half-beams (stumps) that connect to it. We describe approaches for computing an exact polyhedral Constructive Solid Trimming expression of each face and the exact edges and vertices of the hub.
P-buffer: A hidden-line algorithm in image-space
1997, Computers and Graphics (Pergamon)
Despite the emergence of highly realistic computer-generated images, line-drawing images are still a common practice in showing the shapes and movements of three-dimensional objects. It is especially true when rendering time is critical in interactive applications such as the modeling and testing stage of computer aided design/manufacturing, computer animation, and virtual reality. Hence much effort has been devoted to provide sufficient information of the displayed objects with the least amount of time. While the techniques that determine visible surfaces in an image-space have the advantages on rendering speed and processable shapes, those that decide visible lines or line segments in an object-space are more suitable for showing hidden lines. The P-buffer algorithm introduced in this paper is a method for rendering line-drawing images with dashed hidden-lines. Being an image-space method, this algorithm preserves the low computational cost and works on a wide range of object shapes; as an extension to the Z-buffer algorithm it, moreover, discloses hidden surfaces by showing them with dashed lines. After a discussion on rendering techniques of line-drawing images, this paper presents this algorithm with pseudocode in C++ programming language and shows some experimental results as well. This image-space algorithm can be used as a compromise approach that reveals the concealed information of hidden-surface-removed views for time-critical rendering.
2D Multi-Slice and 3D k-Space Simulations using a 3D Quadric Head Phantom with MRI Properties
2015, Advances in Intelligent Systems and Computing
New Decomposition Scheme of Canal Surfaces for Planar Sections Computing
2006, Computer-Aided Design and Applications
Computing planar sections of surfaces of revolution with revolute quadric decomposition
2004, Proceedings - Shape Modeling International SMI 2004

View all citing articles on Scopus

View full text

Technical sectionComputing the intersection of a plane and a revolute quadric

Abstract

Comp. & Graph.

Darstellende Geometrie I

Fundamentals of Three-Dimensional Descriptive Geometry

Vorlesungen über Darstellende Geometrie

Quadrics of revolution

IEEE Comp. Graph. Appl.

Descriptive Geometry and Geometric Modeling: A Basis for Design

Surface Engineering Geometry for Computer Aided Design and Manufacture

Technical section
Computing the intersection of a plane and a revolute quadric