417 search results - page 48 / 84 » Convex Shape Decomposition |
EUROPAR
1995
Springer
13 years 11 months ago
1995
Springer
Abstract. Enhancingcurrentmulticomputerrouters for fault-tolerant routing with modest increasein routing complexity and resource requirements is addressed. The proposed method hand...
CCCG
2003
13 years 9 months ago
2003
We show several natural questions about hinged dissections of polygons to be PSPACE-hard. The most basic of these is: Given a hinged set of pieces and two configurations for them...
EUSFLAT
2003
13 years 9 months ago
2003
Perception based function (PBF) is given by the set of rules Ri:“If X is Ti then Y is Si”, where Ti is a linguistic term describing some fuzzy intervals Ai on the domain of re...
IJRR
2010
13 years 6 months ago
2010
In this paper, we examine non-stretchable 2D polygonal cloth, and place bounds on the number of fingers needed to immobilize it. For any non-stretchable cloth polygon, it is alwa...
COMBINATORICA
2010
13 years 5 months ago
2010
A d-dimensional polycube is a facet-connected set of cubes in d dimensions. Fixed polycubes are considered distinct if they differ in their shape or orientation. A proper d-dimens...