Zawallich, 2025 - Google Patents

Unfolding polyhedra via tabu search

Zawallich, 2025

View HTML
Document ID
3916803750788131134
Author
Zawallich L
Publication year
Publication venue
The Visual Computer

External Links

Snippet

Folding a discrete geometry from a flat sheet of material is one way to construct a 3D object. A typical creation pipeline first designs the 3D object, unfolds it, prints and cuts the unfold pattern from a 2D material, and then refolds the object. Within this work we focus on the …
Continue reading at link.springer.com (HTML) (other versions)

Classifications

    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06F—ELECTRICAL DIGITAL DATA PROCESSING
    • G06F17/00—Digital computing or data processing equipment or methods, specially adapted for specific functions
    • G06F17/50—Computer-aided design
    • G06F17/5086—Mechanical design, e.g. parametric or variational design
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06F—ELECTRICAL DIGITAL DATA PROCESSING
    • G06F17/00—Digital computing or data processing equipment or methods, specially adapted for specific functions
    • G06F17/30—Information retrieval; Database structures therefor; File system structures therefor
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06F—ELECTRICAL DIGITAL DATA PROCESSING
    • G06F17/00—Digital computing or data processing equipment or methods, specially adapted for specific functions
    • G06F17/50—Computer-aided design
    • G06F17/5009—Computer-aided design using simulation
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06T—IMAGE DATA PROCESSING OR GENERATION, IN GENERAL
    • G06T11/00—2D [Two Dimensional] image generation
    • G06T11/20—Drawing from basic elements, e.g. lines or circles
    • G06T11/206—Drawing of charts or graphs
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06F—ELECTRICAL DIGITAL DATA PROCESSING
    • G06F17/00—Digital computing or data processing equipment or methods, specially adapted for specific functions
    • G06F17/20—Handling natural language data
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06T—IMAGE DATA PROCESSING OR GENERATION, IN GENERAL
    • G06T17/00—Three dimensional [3D] modelling, e.g. data description of 3D objects
    • G06T17/20—Finite element generation, e.g. wire-frame surface description, tesselation
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06T—IMAGE DATA PROCESSING OR GENERATION, IN GENERAL
    • G06T2219/00—Indexing scheme for manipulating 3D models or images for computer graphics
    • G06T2219/20—Indexing scheme for editing of 3D models
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06F—ELECTRICAL DIGITAL DATA PROCESSING
    • G06F3/00—Input arrangements for transferring data to be processed into a form capable of being handled by the computer; Output arrangements for transferring data from processing unit to output unit, e.g. interface arrangements
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06F—ELECTRICAL DIGITAL DATA PROCESSING
    • G06F8/00—Arrangements for software engineering
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06Q—DATA PROCESSING SYSTEMS OR METHODS, SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL, SUPERVISORY OR FORECASTING PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL, SUPERVISORY OR FORECASTING PURPOSES, NOT OTHERWISE PROVIDED FOR
    • G06Q10/00—Administration; Management

Similar Documents

Publication Publication Date Title
Hoffmann et al. EREP An editable high-level representation for geometric design and analysis
Kanai et al. Approximate shortest path on a polyhedral surface and its applications
Yu et al. HexGen and Hex2Spline: polycube-based hexahedral mesh generation and spline modeling for isogeometric analysis applications in LS-DYNA
Anotaipaiboon et al. Tool path generation for five-axis NC machining using adaptive space-filling curves
Fudos Constraint solving for computer-aided design
CA2141898A1 (en) Rule based parametric design apparatus and method
Zawallich Unfolding polyhedra via tabu search
Zhang et al. On the linear independence and partition of unity of arbitrary degree analysis-suitable T-splines
Carlos Transformations on parametric design models
Denny et al. A region-based strategy for collaborative roadmap construction
Neto et al. Nagata patch interpolation using surface normal vectors evaluated from the IGES file
Niedermann et al. An algorithmic framework for labeling network maps
Zoccheddu et al. Hexbox: interactive box modeling of hexahedral meshes
Manni et al. Standard and non-standard CAGD tools for isogeometric analysis: a tutorial
Moulaeifard et al. Subdivide and conquer: adapting non-manifold subdivision surfaces to surface-based representation and reconstruction of complex geological structures
Pernot et al. Fully free-form deformation features for aesthetic shape design
Reif et al. Minimizing turns for discrete movement in the interior of a polygon
Wortmann Representing shapes as graphs: a feasible approach for the computer implementation of parametric visual calculating
Bo et al. Topological structure extraction for computing surface–surface intersection curves
Arseneva et al. Adjacency graphs of polyhedral surfaces
Liu et al. STEP-NC compliant data model for freeform surface manufacturing based on T-spline
Karanam et al. Geometry based pre-processor for parallel fluid dynamic simulations using a hierarchical basis
van Dijk et al. Location‐dependent generalization of road networks based on equivalent destinations
Chase Design modeling with shape algebras and formal logic
Sansebastiano et al. The relationship between “c-space”,“heuristic methods”, and “sampling based planner”