Depth-order point classification techniques for CSG display algorithms

Jansen, Frederik W.

doi:10.1145/99902.99904

Cited by 14 publications

(3 citation statements)

References 24 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…These methods have progressed from a special kind of z-buffer [Okino84,VanHook86,Rossignac86] to usage of multiple z and frame buffers and multiple rendering passes [Goldfeather86,Jansen86,Jansen87,Goldfeather89,Rossignac90,Jansen91]. These methods do support real-time rendering of CSG models (naturally, depending upon the model size), but are not practical for every-day use because they require expensive special purpose hardware that is not easily available.…”

Section: Introductionmentioning

confidence: 99%

Interactive Boolean operations for conceptual design of 3-D solids

Rappoport

Spitz

1997

Proceedings of the 24th Annual Conference on Computer Graphics and Interactive Techniques - SIGGRAPH '97

View full text Add to dashboard Cite

Interactive modeling of 3-D solids is an important and difficult problem in computer graphics. The Constructive Solid Geometry (CSG) modeling scheme is highly attractive for interactive design, due to its support for hierarchical modeling and Boolean operations. Unfortunately, current algorithms for interactive display of CSG models require expensive special-purpose hardware that is not easily available.In this paper we present a method for interactive display of CSG models using standard, widely available graphics hardware. The method enables the user to interactively modify the affine transformations associated with CSG sub-objects. The application we focus upon is that of conceptual design, a stage in the design process in which rapid, interactive visualization of the model and high-level design operations are of crucial importance, while the objects are relatively simple.The method converts the CSG graph to a novel Convex Differences Aggregate(CDA) representation. The CDA utilizes graph re-writing techniques, efficient geometric algorithms on convex objects and a built-in hierarchical acceleration scheme. The CDA rendering algorithm is very simple, takes advantage of standard graphics hardware, and makes efficient use of system resources by splitting the work between the graphics system and the CPU.

show abstract

Section: Introductionmentioning

confidence: 99%

Interactive Boolean operations for conceptual design of 3-D solids

Rappoport

Spitz

1997

Proceedings of the 24th Annual Conference on Computer Graphics and Interactive Techniques - SIGGRAPH '97

View full text Add to dashboard Cite

show abstract

“…Space partition is a classic computational geometry technique to reduce complexities of geometries in local regions and thus the computational complexity over the whole space. It has been used in many applications, for example, in ray tracing where it helps to reduce the number of raylobject intersections (Woodward, 1989), in volume rendering (Subramanian and Fussell, 1990), and in displaying constructive solid geometry (CSG) (Jansen, 1991).…”

Section: Point Classification and Space Partitionmentioning

confidence: 99%

Protein modeling, ligand-protein docking, and visualization

Lu¹

View full text Add to dashboard Cite

With more and more protein structures being identified, as well as rapid developments in the pharmaceutical industry, computational biology is increasingly playing a vital role in biological data retrieval, analysis, and visualization. Cost-effective approaches to identify the docking potential between proteins and ligands are highly desirable. Successful docking of ligands and proteins is the goal in a virtual screening process. The docking methods involve system representation, conformational searching and matching, and ranking mechanisms. Docking algorithms are typically very time consuming. But in the early stages of drug discovery, there is generally a need for a massive virtual screening process to identify potential drug candidates or pharmacophores. This motivates us to develop a ligand-protein docking algorithm with emphasis on high performance. The docking of ligands and proteins occurs on the surfaces of the bio-molecules. Hence, it is important to have good representations of the protein surface. In this research, a partition-based molecular implicit surface (PMIS) is proposed to represent the bio-molecular (protein) solvent-accessible surface (SAS). The implicit model and space partition algorithm make PMIS unique in determining the point-surface relationship. Therefore, PMIS can facilitate structural research such as interactive or geometric docking of proteins and ligands.

show abstract

“…Some approaches [35,40,57] use a disjunctive form (union of intersections) formulation of the Boolean expression to simplify trimming. A surfel lies on a product if it is the furthest of the front facing surfels at that pixel and if it lies in front of all back facing surfels at that pixel [57]. Unfortunately, the number of intersections (products of a disjunctive form) may grow exponentially with the number of primitives.…”

Section: Rendering Effectsmentioning

confidence: 99%

Direct rendering of feature-based skinning deformations

Βασιλάκης¹

View full text Add to dashboard Cite

Η παρούσα διατριβή μελετά το πρόβλημα της άμεσης απόδοσης των προσεγγιστικών παραμορφώσεων του (πιθανώς αυτο-τεμνούμενου) περιβλήματος αυθαίρετων αντικειμένων, που είναι ένα πολύ σημαντικό θέμα στις περιοχές της προσομοίωσης κίνησης και της οπτικοποίησης. Αρχικά, προσφέρουμε μεθόδους για την αποτελεσματική αναπαράσταση της διαμέρισης και της προσεγγιστικής παραμόρφωσης μιας ακολουθίας στιγμιότυπων ενός αντικειμένου, στοχεύοντας στη διατήρηση της χρονικής συνάφειας, τη μείωση των σφαλμάτων και την επεξεργασία αυθαίρετων στιγμιότυπων της κίνησης. Στη συνέχεια, αντιμετωπίζουμε το πρόβλημα απόδοσης αυτο-τεμνόμενων επιφανειών κατά την παραμόρφωση με χρήση σημασιολογικών κανόνων και το πρόβλημα αποδοτικής και ακριβής αποθήκευσης όλων των επιπέδων μιας παραγόμενης σκηνής με χρήση αλγορίθμων που χρησιμοποιούν την ενδιάμεση μνήμη της κάρτας γραφικών. Συγκεκριμένα, προτείνονται κανόνες για τον καθορισμό του εσωτερικού και εξωτερικού των χωρικών στοιχείων που σχηματίζονται από μία αυτο-τεμνόμενη επιφάνεια μέσω μίας διαδικασίας συνεχούς παραμόρφωσης μίας απλής κλειστής επιφάνειας. Επίσης, αναπτύσσουμε αποδοτικούς αλγορίθμους πραγματικού χρόνου που αποφεύγουν τα προβλήματα συν-επιπεδότητας, υπερχείλισης και υψηλής συμφόρησης στη μνήμη της κάρτας γραφικών, για την απόδοση του ορίου του στερεού που προκύπτει, αποφεύγοντας τον υπολογισμό των καμπυλών που εκφράζουν τα σημεία αυτο-τομής της επιφάνειας.

show abstract

Depth-order point classification techniques for CSG display algorithms

Cited by 14 publications

References 24 publications

Interactive Boolean operations for conceptual design of 3-D solids

Interactive Boolean operations for conceptual design of 3-D solids

Protein modeling, ligand-protein docking, and visualization

Direct rendering of feature-based skinning deformations

Contact Info

Product

Resources

About