Results 11  20
of
108,150
Geometry C
"... level abstractions such as trimmed NURBS. Detailed surface geometry can many times be rendered by use of texture maps. But as realism is added, more and more raw geometry is required, usually in the form of triangles. Position, color, and normal components of these in full floating point accuracy. ..."
Abstract
 Add to MetaCart
. 2 REPRESENTATION OF GEOMETRY Today, most major MCAD and many animation modeling packages allow the use of CSG (constructive solid geometry) and freeform NURBS in the construction and representation of geometry. The rere a highlevel representation ver for hardware rendering, ted in software
Combining Geometry and Domain Knowledge to
"... Interpret HandDrawn Diagrams We present a sketch understanding system for networklike diagrams consisting of symbols linked together. This system employs a novel parser to automatically extract symbols from a continuous stream of pen strokes. The parser uses geometric information to enumerate cand ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
Interpret HandDrawn Diagrams We present a sketch understanding system for networklike diagrams consisting of symbols linked together. This system employs a novel parser to automatically extract symbols from a continuous stream of pen strokes. The parser uses geometric information to enumerate
Fast Constructive Solid Geometry Display
 in the PixelPower Graphics System, ACM SIGGRAPH '86 Proc., Computer Graphics
, 1986
"... We present two Mgorithms for the display of CSGdefined objects on PixelPowers, an extension of the PixelPlanes logicenhanced memory architecture, which calculates for each and every pixel on the screen (in parallel) the value of any quadratic function in the screen coordinates (x,y). The first ..."
Abstract

Cited by 20 (1 self)
 Add to MetaCart
We present two Mgorithms for the display of CSGdefined objects on PixelPowers, an extension of the PixelPlanes logicenhanced memory architecture, which calculates for each and every pixel on the screen (in parallel) the value of any quadratic function in the screen coordinates (x,y). The first algorithm restructures any CSG tree into an equivalent, but possibly larger, tree whose display can be achieved by the second algorithm. The second algorithm traverses the restructured tree and generates quadratic coefficients and opcodes for PixelPowers. These opcodes instruct PixelPowers to generate the boundaries of primitives and perform set operations using the standard Zbuffer algorithm. Several externallysupplied CSG data sets have been processed with the new treetraversal algorithm and an associated PixelPowers simulator. The resulting images indicate that good results can be obtained very rapidly with the new system. For example, the commonly used MBB test part (at right) with 24 primitives is translated into approximately 1900 quadratic equations. On a PixelPowers system running at 10MHz (the speed at which our current PixelPlanes memories run), the image should be rendered in about 7.5 milliseconds.
DESCRIPTIVE GEOMETRY IN THE
, 1952
"... 9 ^ m PREFACE During his several years of teaching descriptive geometry to combined c lasses of engineering and geology students the author has become convinced that the two groups should be separated and offered a different presentation of the subject. There are two reasons for this conviction. In ..."
Abstract
 Add to MetaCart
9 ^ m PREFACE During his several years of teaching descriptive geometry to combined c lasses of engineering and geology students the author has become convinced that the two groups should be separated and offered a different presentation of the subject. There are two reasons for this conviction
Shapes And Implementations In ThreeDimensional Geometry
, 1993
"... Frequently, data in scientific computing is in its abstract form a finite point set in space, and it is often useful or required to compute what one might call the "shape" of the set. For that purpose, this thesis deals with the formal notion of the family of alpha shapes of a finite point ..."
Abstract

Cited by 39 (5 self)
 Add to MetaCart
point set in three dimensional space. Each shape is a welldefined polytope, derived from the Delaunay triangulation of the point set, with a real parameter controlling the desired level of detail. Algorithms and data structures are presented that construct and store the entire family of shapes, with a
Application Challenges to Computational Geometry
, 1996
"... With rapid advances in computer hardware and visualization systems, geometric computing is creeping into virtually every corner of science and engineering, from design and manufacturing to astrophysics to molecular biology to fluid dynamics. This report assesses the opportunities and challenges this ..."
Abstract
 Add to MetaCart
With rapid advances in computer hardware and visualization systems, geometric computing is creeping into virtually every corner of science and engineering, from design and manufacturing to astrophysics to molecular biology to fluid dynamics. This report assesses the opportunities and challenges
Dynamic Projective Geometry
, 1999
"... iAbstract The theme of this thesis is dynamic geometry, a new way of exploring classical geometry using interactive computer software. This kind of software allows the user to make geometric constructions on a computer's screen. The constructions might consist of points, lines and conics whose ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
iAbstract The theme of this thesis is dynamic geometry, a new way of exploring classical geometry using interactive computer software. This kind of software allows the user to make geometric constructions on a computer's screen. The constructions might consist of points, lines and conics whose
Computers & Graphics] (]]]])]]]–]]] Combining geometry and domain knowledge to interpret handdrawn
"... diagrams ..."
Geometry Simplification
, 1999
"... In this work we present the principles and applications of geometry simplification, focusing on simplification of polygonal representations of solids and surfaces. Related concepts such as multiresolution, levelofdetail and geometry compression are also discussed. A characterization of surface ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
In this work we present the principles and applications of geometry simplification, focusing on simplification of polygonal representations of solids and surfaces. Related concepts such as multiresolution, levelofdetail and geometry compression are also discussed. A characterization of surface
Results 11  20
of
108,150