作者：
Franklin, Wm. RandolphElectrical
Computer and Systems Engineering Dept. 6026 J.E.C. Rensselaer Polytechnic Institute TroyNY12180 United States
Calculating properties of polyhedra given only the set of the locations and neighborhoods of the verticesis easy. Possible properties include volume, surface area, and point containment testing. No global topological ...
详细信息
This conference proceedings contains 34 papers. The main subjects are computergraphics animation, ray tracing techniques and algorithms, graphics systems surface rendering, curve and surface algorithms, volumetric mo...
详细信息
ISBN:
(纸本)0897912276
This conference proceedings contains 34 papers. The main subjects are computergraphics animation, ray tracing techniques and algorithms, graphics systems surface rendering, curve and surface algorithms, volumetric modeling, computergraphics hardware algorithms, dynamic constraints modeling and simulation, two dimensional graphics algorithms, texturing and shadowing, and lighting models.
This paper summarizes two results in motion planning, the details of which are in two technical *** first establishes an ω[n4) lower bound on moving a ladder (a line segment) in threedimensions in the presence of pol...
详细信息
Given a set of n vertices in the plane together with a set of noncrossing edges, the constrained Delaunay triangulation (CDT) is the triangulation of the vertices with the following properties: (1) the prespecified ed...
详细信息
Algorithms are developed for determining if a set of polyhedral objects in R3 can be intersected by a common transversal (stabbing) line. It can be determined in O (n ) time if a set of n lines in space has a line tra...
We present an O(nlogn) time and 0{n) space algorithm for the following problem in a simple polygon P withn vertices: For each vertex u al P, find another vertex φ(u) that is furthest from u , where the distancebetwee...
详细信息
We show that nondegenerate Delaunay triangulations satisfy a combinatorial property called 1-toughness. Agraph with set of sites S is 1-tough if for any set P ⊆ S, c(S - P) ≤ \S\, where c(5 - P) is the number of comp...
详细信息
New modelling primitives and new rendering techniques are appearing at a rapid rate. To be able to implement and evaluate them easily, we need a very flexible display environment. We describe an environment which allo...
详细信息
ISBN:
(纸本)0897912276
New modelling primitives and new rendering techniques are appearing at a rapid rate. To be able to implement and evaluate them easily, we need a very flexible display environment. We describe an environment which allows experimenting both with the basic modelling and rendering operations and with the process structure of the display system. The desired operations are implemented in nodes, coded in a traditional programming language, which can then be structured into arbitrary directed acyclic graphs. These nodes are all "plug compatible", and pass streams of appels, which are generalized pixels, that is data structures containing information necessary for pixel evaluation. In addition, synchronization parameters are used to allow the expansion or the reduction of the stream of appels. This approach allows the assembly of new display systems from existing modules without coding, making it easy to experiment with different architectures and display processes. Algorithm designers are also able to test an algorithm at any point of the display process with a minimum of new coding. We describe an implementation of the scheme with a library of nodes written in C and the assembly of the graphs made through the use of the directory manipulation tools provided under UNIX™. We give examples of the uses of the implementation to build basic nodes, variations in compositing and texture mapping and special-purpose display systems.
The presentation of an application program specifies how the data and operations provided by an application are presented to users. Most traditional techniques for implementing presentations lead to unstructured, unmo...
详细信息
ISBN:
(纸本)0897912136
The presentation of an application program specifies how the data and operations provided by an application are presented to users. Most traditional techniques for implementing presentations lead to unstructured, unmodular implementations that are hard to construct and change. We present a model of presentation that identifies the dependencies between the presentation and functionality portions of an application. Based on this model, we show how several implementation techniques can be used to construct presentations in a modular way.
暂无评论