Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

9

COMPGEOM
1995
ACM

favoriteEmaildiscussreport

117views Discrete Geometry» more COMPGEOM 1995»

Representation and Computation of Boolean Combinations of Sculptured Models

13 years 7 months ago

Representation and Computation of Boolean Combinations of Sculptured Models

Download public.research.att.com

We outline an algorithm and implementation of a system that computes Boolean combinations of sculptured solids. We represent the surface of the solids in terms of trimmed and untrimmed spline surfaces and a connectivity graph. Based on algorithms for trapezoidation of polygons, partitioning of polygons, surface intersection and ray-shooting, we compute the boundaries of the resulting solids after the Boolean operation.

Shankar Krishnan, Atul Narkhede, Dinesh Manocha

Real-time Traffic

Boolean Combinations | COMPGEOM 1995 | Discrete Geometry | Sculptured Solids | Untrimmed Spline Surfaces |

claim paper

Related Content

» LocalSearch Techniques for Boolean Combinations of PseudoBoolean Constraints

» Computational schemes for biomimetic sculpture

» Direct Haptic Rendering of Sculptured Models

» Boolean Operations on Featurebased Models

» Boolean combinations of weighted voting games

» Computing Optimized Representations for Nonconvex Polyhedra by Detection and Removal of Re...

» MultiResolution Modeling and Locally Refined Collision Detection for Haptic Interaction

» Boolean Algebras for Lambda Calculus

» Algorithms for Solving Boolean Satisfiability in Combinational Circuits

Post Info
More Details (n/a)

Added	25 Aug 2010
Updated	25 Aug 2010
Type	Conference
Year	1995
Where	COMPGEOM
Authors	Shankar Krishnan, Atul Narkhede, Dinesh Manocha

Comments (0)