OCTOR: Subset selection in recursive pattern hierarchies

Authors:
Justin Jang;Jarek Rossignac
Affiliations:
Georgia Institute of Technology, School of Interactive Computing, Technology Square Research Building, 85, 5th St., NW, Atlanta, GA 30332-0760, United States;Georgia Institute of Technology, School of Interactive Computing, Technology Square Research Building, 85, 5th St., NW, Atlanta, GA 30332-0760, United States
Venue:
Graphical Models
Year:
2009

Citing 7
Cited 1

Interactive design with sequences of parameterized transformations

Intelligent CAD systems II: implementational issues
Constraints in constructive solid geometry

I3D '86 Proceedings of the 1986 workshop on Interactive 3D graphics
Multiple selections in smart text editing

Proceedings of the 7th international conference on Intelligent user interfaces
A survey of the persistent naming problem

Proceedings of the seventh ACM symposium on Solid modeling and applications
Recognizing Geometric Patterns for Beautification of Reconstructed Solid Models

SMI '01 Proceedings of the International Conference on Shape Modeling & Applications
Group Selection Techniques for Efficient 3D Modeling

3DUI '06 Proceedings of the 3D User Interfaces
CST: Constructive Solid Trimming for Rendering BReps and CSG

IEEE Transactions on Visualization and Computer Graphics

Steady affine motions and morphs

ACM Transactions on Graphics (TOG)

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present an approach for encoding and specifying selections in recursive pattern hierarchies. Hierarchies of patterns of features or other modeling entities are used in architectural and mechanical CAD to eliminate laborious repetitions from the design process. Yet, often a subset of the repeated occurrences in the model must be edited. Specifying a desired selection is often tedious and difficult. Our approach addresses these two drawbacks simultaneously, offering an effective and intuitive solution which requires only two mouse-clicks to specify any one of a wide range of selections, including selections in recursive hierarchies. The selection has a concise representation that is simple to compute.