A Quasilinear-Time Algorithm for Tiling the Plane Isohedrally with a Polyomino.
Stefan LangermanAndrew WinslowPublished in: SoCG (2016)
Keyphrases
- experimental evaluation
- learning algorithm
- theoretical analysis
- high accuracy
- dynamic programming
- computational cost
- objective function
- computational complexity
- preprocessing
- np hard
- segmentation algorithm
- computationally efficient
- detection algorithm
- path planning
- worst case
- times faster
- search space
- optimal solution
- convex hull
- memory requirements
- recognition algorithm
- differential equations
- improved algorithm
- least squares
- matching algorithm
- linear programming
- data sets
- k means
- similarity measure
- three dimensional
- image segmentation
- neural network