Principles of interactive computer graphics (2nd ed.)
Principles of interactive computer graphics (2nd ed.)
A procedure for generation of three-dimensional half-toned computer graphics presentations
Communications of the ACM
An algorithm for hidden line elimination
Communications of the ACM
Marching cubes: A high resolution 3D surface construction algorithm
SIGGRAPH '87 Proceedings of the 14th annual conference on Computer graphics and interactive techniques
Communications of the ACM
A rule-based system for dense-map name placement
Communications of the ACM
A generic solution to polygon clipping
Communications of the ACM
A new, fast method for 2D polygon clipping: analysis and software implementation
ACM Transactions on Graphics (TOG)
The feudal priority algorithm on hidden-surface removal
SIGGRAPH '96 Proceedings of the 23rd annual conference on Computer graphics and interactive techniques
Efficient clipping of arbitrary polygons
ACM Transactions on Graphics (TOG)
SCG '85 Proceedings of the first annual symposium on Computational geometry
Integrated analytic spatial and temporal anti-aliasing for polyhedra in 4-space
SIGGRAPH '85 Proceedings of the 12th annual conference on Computer graphics and interactive techniques
Level-of-detail volume rendering via 3D textures
VVS '00 Proceedings of the 2000 IEEE symposium on Volume visualization
A Characterization of Ten Hidden-Surface Algorithms
ACM Computing Surveys (CSUR)
An analysis and algorithm for polygon clipping
Communications of the ACM
High-performance polygon rendering
SIGGRAPH '88 Proceedings of the 15th annual conference on Computer graphics and interactive techniques
An efficient implementation of parametric line and polygon clipping algorithm
Proceedings of the 2002 ACM symposium on Applied computing
An interdisciplinary laboratory for graphics research and applications
SIGGRAPH '77 Proceedings of the 4th annual conference on Computer graphics and interactive techniques
Hidden surface removal using polygon area sorting
SIGGRAPH '77 Proceedings of the 4th annual conference on Computer graphics and interactive techniques
General clipping on an oblique viewing frustrum
SIGGRAPH '77 Proceedings of the 4th annual conference on Computer graphics and interactive techniques
Efficient Polygon Clipping for an SIMD Graphics Pipeline
IEEE Transactions on Visualization and Computer Graphics
Non-overlapping Constraints between Convex Polytopes
CP '01 Proceedings of the 7th International Conference on Principles and Practice of Constraint Programming
Translating a convex polyhedron over monotone polyhedra
Computational Geometry: Theory and Applications
Parallel ray tracing on a chip
Practical parallel rendering
A device independent graphics imaging model for use with raster devices
SIGGRAPH '82 Proceedings of the 9th annual conference on Computer graphics and interactive techniques
An extended Algol-60 for Shaded Computer Graphics
The papers of the ACM symposium on Graphic languages
A graphics typesetting language
Proceedings of the ACM SIGPLAN SIGOA symposium on Text manipulation
A hidden-surface algorithm with anti-aliasing
SIGGRAPH '78 Proceedings of the 5th annual conference on Computer graphics and interactive techniques
Hidden line removal for vector graphics
SIGGRAPH '78 Proceedings of the 5th annual conference on Computer graphics and interactive techniques
Clipping using homogeneous coordinates
SIGGRAPH '78 Proceedings of the 5th annual conference on Computer graphics and interactive techniques
Polygon comparison using a graph representation
SIGGRAPH '80 Proceedings of the 7th annual conference on Computer graphics and interactive techniques
Simulation and expected performance analysis of multiple processor Z-buffer systems
SIGGRAPH '80 Proceedings of the 7th annual conference on Computer graphics and interactive techniques
Integrating solid image capability into a general purpose calligraphic graphics package
SIGGRAPH '80 Proceedings of the 7th annual conference on Computer graphics and interactive techniques
Dynamic scan-converted images with a frame buffer display device
SIGGRAPH '80 Proceedings of the 7th annual conference on Computer graphics and interactive techniques
An analytic visible surface algorithm for independent pixel processing
SIGGRAPH '84 Proceedings of the 11th annual conference on Computer graphics and interactive techniques
Interactive simulation of biomechanical systems: The kinematics and stress of the human knee
ACM '78 Proceedings of the 1978 annual conference - Volume 2
Interactive design of visual aids
ACM '77 Proceedings of the 1977 annual conference
Geometric clipping using boolean textures
VIS '93 Proceedings of the 4th conference on Visualization '93
Triggering Creativity in Science and Engineering: Reflection as a Catalyst
Journal of Intelligent and Robotic Systems
ACM SIGGRAPH Computer Graphics
A multi-processor system for hidden-surface-removal
ACM SIGGRAPH Computer Graphics
The relation between perspective and photographic transform
ACM SIGGRAPH Computer Graphics
Journal of Computing Sciences in Colleges
Computing and Managing Cardinal Direction Relations
IEEE Transactions on Knowledge and Data Engineering
Continuations and transducer composition
Proceedings of the 2006 ACM SIGPLAN conference on Programming language design and implementation
Journal of Computational Physics
Computer-Aided Design
ACM Turing award lectures
Set Membership Classification: A Unified Approach to Geometric Intersection Problems
IEEE Transactions on Computers
A balanced force refined level set grid method for two-phase flows on unstructured flow solver grids
Journal of Computational Physics
Progressive radiosity method on clusters using a new clipping algorithm
International Journal of High Performance Computing and Networking
Random-access rendering of general vector graphics
ACM SIGGRAPH Asia 2008 papers
Modeling time and topology for animation and visualization with examples on parametric geometry
Theoretical Computer Science
Haskell session types with (almost) no class
Proceedings of the first ACM SIGPLAN symposium on Haskell
Edutainment '08 Proceedings of the 3rd international conference on Technologies for E-Learning and Digital Entertainment
Inferring graphical procedures: the compleat metarnouse
Human-Computer Interaction
MIDAS: a compositional modeling system
AFIPS '77 Proceedings of the June 13-16, 1977, national computer conference
Aspects of modelling in computer aided geometric design
AFIPS '75 Proceedings of the May 19-22, 1975, national computer conference and exposition
A new algorithm for computing Boolean operations on polygons
Computers & Geosciences
Technical section: A new algorithm for Boolean operations on general polygons
Computers and Graphics
Isotropic remeshing with fast and exact computation of Restricted Voronoi Diagram
SGP '09 Proceedings of the Symposium on Geometry Processing
We are family: joint pose estimation of multiple persons
ECCV'10 Proceedings of the 11th European conference on Computer vision: Part I
The mimetic finite difference method for the 3D magnetostatic field problems on polyhedral meshes
Journal of Computational Physics
Proceedings of the 38th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Short note: The addition of fields on different meshes
Journal of Computational Physics
MSBVH: an efficient acceleration data structure for ray traced motion blur
Proceedings of the ACM SIGGRAPH Symposium on High Performance Graphics
Algorithms for vector graphic optimization and compression
CGI'06 Proceedings of the 24th international conference on Advances in Computer Graphics
Dynamic positioning based on voronoi cells (DPVC)
RoboCup 2005
An efficient algorithm for clipping operation based on trapezoidal meshes and sweep-line technique
Advances in Engineering Software
Efficient computation of 3d clipped voronoi diagram
GMP'10 Proceedings of the 6th international conference on Advances in Geometric Modeling and Processing
Journal of Scientific Computing
Centroidal Voronoi Tessellation of Line Segments and Graphs
Computer Graphics Forum
A real-time beam tracer with application to exact soft shadows
EGSR'07 Proceedings of the 18th Eurographics conference on Rendering Techniques
Developments in high performance CGI systems
EGGH'86 Proceedings of the First Eurographics conference on Advances in Computer Graphics Hardware
Parallel processing on a transputer-based graphics board
EGGH'88 Proceedings of the Third Eurographics conference on Advances in Computer Graphics Hardware
EGGH'92 Proceedings of the Seventh Eurographics conference on Graphics Hardware
Efficient computation of clipped Voronoi diagram for mesh generation
Computer-Aided Design
A simple algorithm for Boolean operations on polygons
Advances in Engineering Software
A scalable, efficient scheme for evaluation of stencil computations over unstructured meshes
SC '13 Proceedings of the International Conference on High Performance Computing, Networking, Storage and Analysis
Dual space directional occlusion
The Visual Computer: International Journal of Computer Graphics
Hi-index | 48.30 |
A new family of clipping algorithms is described. These algorithms are able to clip polygons against irregular convex plane-faced volumes in three dimensions, removing the parts of the polygon which lie outside the volume. In two dimensions the algorithms permit clipping against irregular convex windows.Polygons to be clipped are represented as an ordered sequence of vertices without repetition of first and last, in marked contrast to representation as a collection of edges as was heretofore the common procedure. Output polygons have an identical format, with new vertices introduced in sequence to describe any newly-cut edge or edges. The algorithms easily handle the particularly difficult problem of detecting that a new vertex may be required at a corner of the clipping window.The algorithms described achieve considerable simplicity by clipping separately against each clipping plane or window boundary. Code capable of clipping the polygon against a single boundary is reentered to clip against subsequent boundaries. Each such reentrant stage of clipping need store only two vertex values and may begin its processing as soon as the first output vertex from the preceeding stage is ready. Because the same code is reentered for clipping against subsequent boundaries, clipping against very complex window shapes is practical.For perspective applications in three dimensions, a six-plane truncated pyramid is chosen as the clipping volume. The two additional planes parallel to the projection screen serve to limit the range of depth preserved through the projection. A perspective projection method which provides for arbitrary view angles and depth of field in spite of simple fixed clipping planes is described. This method is ideal for subsequent hidden-surface computations.