According to our database1, Markku Tamminen
Legend:Book In proceedings Article PhD thesis Other
Corrigenda: 'A General Approach to Connected-Component Labelling for Arbitrary Image Representations'.
J. ACM, 1992
A General Approach to Connected-Component Labelling for Arbitrary Image Representations.
J. ACM, 1992
Approximating CSG trees of moving objects.
The Visual Computer, 1990
XE design rationale: Clu revisited.
SIGPLAN Notices, 1989
Buidling an Embedded Knowledge-Based Application Using Abstractions.
Efficient Component Labeling of Images of Arbitrary Dimension Represented by Linear Bintrees.
IEEE Trans. Pattern Anal. Mach. Intell., 1988
A Hierarchical Global Wiring Algorithm for Custom Chip Design.
IEEE Trans. on CAD of Integrated Circuits and Systems, 1987
XC - A Language for Embedded Rule Based Systems.
SIGPLAN Notices, 1987
Constructing Maximal Slicings from Geometry.
Acta Inf., 1986
A viewing pipeline for discrete solid modeling.
The Visual Computer, 1985
Computing Geometric Properties of Images Represented by Linear Quadtrees.
IEEE Trans. Pattern Anal. Mach. Intell., 1985
Two Levels are as Good as Any.
J. Algorithms, 1985
An integrity filter for recursive subdivision meshes.
Computers & Graphics, 1985
On Search by Address Computation.
Bintrees, CSG trees, and time.
Proceedings of the 12th Annual Conference on Computer Graphics and Interactive Techniques, 1985
Encoding pixel trees.
Computer Vision, Graphics, and Image Processing, 1984
Comment on Quad- and Octtrees.
Commun. ACM, 1984
Efficient octree conversion by connectivity labeling.
Proceedings of the 11th Annual Conference on Computer Graphics and Interactive Techniques, 1984
Analysis of N-Trees.
Inf. Process. Lett., 1983
Performance analysis of cell based geometric file organizations.
Computer Vision, Graphics, and Image Processing, 1983
Localized set operations for solid modeling.
Proceedings of the 10th Annual Conference on Computer Graphics and Interactive Techniques, 1983
Extendible Hashing with Overflow.
Inf. Process. Lett., 1982
Hidden Lines using the EXCELL Method.
Comput. Graph. Forum, 1982
The Extendible Cell Method for Closest Point Problems.
Efficient Spatial Access to a Data Base.
Proceedings of the 1982 ACM SIGMOD International Conference on Management of Data, 1982
The excell method for efficient geometric access to data.
Proceedings of the 19th Design Automation Conference, 1982
Order Preserving Extendible Hashing and Bucket Tries.