Automatic lay planning for irregular shapes on plain fabric. Search in direct graph and Aɛ ɛ-admissible resolution.
G. RousselSalah MaouchePublished in: System Modelling and Optimization (1993)
Keyphrases
- search space
- search algorithm
- search strategy
- search strategies
- semi automatic
- graph representation
- state space
- heuristic search
- irregularly shaped
- breadth first search
- path finding
- weighted graph
- graph structure
- bipartite graph
- shape descriptors
- shape model
- domain independent
- high resolution
- planning problems
- search methods
- graph model
- graph partitioning
- fully automatic
- planning graph
- solution path
- forward search
- social networks