Author of the publication

Proper n-Cell Polycubes in n - 3 Dimensions.

, , , and . COCOON, volume 6842 of Lecture Notes in Computer Science, page 180-191. Springer, (2011)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

 

Other publications of authors with the same name

Counting n-cell polycubes proper in n-k dimensions., and . Eur. J. Comb., (2017)Offset-Polygon Annulus Placement Problems., , , and . WADS, volume 1272 of Lecture Notes in Computer Science, page 378-391. Springer, (1997)Applications of geometric hashing to the repair, reconstruction, and matching of three-dimensional objects. Tel Aviv University, Israel, (1994)Tel Aviv University Library.Counting d-Dimensional Polycubes and Nonrectangular Planar Polyominoes., and . COCOON, volume 4112 of Lecture Notes in Computer Science, page 418-427. Springer, (2006)Proper n-Cell Polycubes in n - 3 Dimensions., , , and . COCOON, volume 6842 of Lecture Notes in Computer Science, page 180-191. Springer, (2011)Algorithms for Counting Minimum-Perimeter Lattice Animals., and . Algorithmica, 85 (1): 75-99 (2023)Diamonds are Forever in the Blockchain: Geometric Polyhedral Point-Set Pattern Matching., , , , , and . CoRR, (2022)Properties of Minimal-Perimeter Polyominoes., and . COCOON, volume 10976 of Lecture Notes in Computer Science, page 120-129. Springer, (2018)Bounded-degree polyhedronization of point sets., , , , , , , , , and 1 other author(s). CCCG, page 99-102. (2010)Maximizing the area of an axis-symmetric polygon inscribed by a convex polygon., and . CCCG, page 128-131. (2004)