Markku Tamminen - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 30 from 30

1992

Corrigenda: A General Approach to Connected-Component Labelling for Arbitrary Image Representations Michael B. Dillencourt, Hanan Samet, Markku Tamminen. JACM, 39(4):985-986, 1992.

A General Approach to Connected-Component Labelling for Arbitrary Image RepresentationsMichael B. Dillencourt, Hanan Samet, Markku Tamminen. JACM, 39(2):253-280, 1992. [doi]

1990

Approximating CSG trees of moving objectsHanan Samet, Markku Tamminen. vc, 6(4):182-209, 1990.

1989

Buidling an Embedded Knowledge-Based Application Using AbstractionsM. Bouteldja, Markku Tamminen. scai 1989: 643-656

XE design rationale: Clu revisitedVesa Hirvisalo, Jari Arkko, Juha Kuusela, Esko Nuutila, Markku Tamminen. SIGPLAN, 24(9):72-79, 1989. [doi]

1988

Efficient Component Labeling of Images of Arbitrary Dimension Represented by Linear BintreesHanan Samet, Markku Tamminen. pami, 10(4):579-586, 1988. [doi]

1987

A Hierarchical Global Wiring Algorithm for Custom Chip DesignW. K. Luk, Paolo Sipala, Markku Tamminen, Donald T. Tang, Lin S. Woo, Chak-Kuen Wong. tcad, 6(4):518-533, 1987. [doi]

XC - A Language for Embedded Rule Based SystemsEsko Nuutila, Juha Kuusela, Markku Tamminen, Jukka Veilahti, Jari Arkko, Nassim Bouteldja. SIGPLAN, 22(9):23-32, 1987.

1986

Constructing Maximal Slicings from GeometryMarkku Tamminen, W. K. Luk, Paolo Sipala, Lin S. Woo, C. K. Wong. ACTA, 23(3):267-288, 1986.

1985

Viewing solid Models by Bintree conversionPetri Koistinen, Markku Tamminen, Hanan Samet. eurographics 1985: [doi]

A viewing pipeline for discrete solid modelingKlaus Kronlof, Markku Tamminen. vc, 1(1):24-36, 1985.

Bintrees, CSG trees, and timeHanan Samet, Markku Tamminen. siggraph 1985: 121-130 [doi]

Computing Geometric Properties of Images Represented by Linear QuadtreesHanan Samet, Markku Tamminen. pami, 7(2):229-240, 1985. [doi]

Two Levels are as Good as AnyMarkku Tamminen. jal, 6(1):138-144, 1985.

On Search by Address ComputationMarkku Tamminen. bit, 25(1):135-147, 1985.

An integrity filter for recursive subdivision meshesMarkku Tamminen, Frederik W. Jansen. cg, 9(4):351-363, 1985. [doi]

1984

Experiences with New Image Component AlgorithmsHanan Samet, Markku Tamminen. eurographics 1985: [doi]

Comment on Quad- and OcttreesMarkku Tamminen. CACM, 27(3):248-249, 1984.

Encoding pixel treesMarkku Tamminen. cvgip, 28(1):44-57, 1984. [doi]

Efficient octree conversion by connectivity labelingMarkku Tamminen, Hanan Samet. siggraph 1984: 43-51 [doi]

1983

Localized set operations for solid modelingMartti Mäntylä, Markku Tamminen. siggraph 1983: 279-288 [doi]

Performance analysis of cell based geometric file organizationsMarkku Tamminen. cvgip, 24(2):160-181, 1983. [doi]

Analysis of N-TreesMarkku Tamminen. ipl, 16(3):131-137, 1983.

A Geometric Data ManagerMatti Tikkanen, Martti Mäntylä, Markku Tamminen. eurographics 1983: [doi]

1982

Hidden Lines using the EXCELL MethodMarkku Tamminen. cgf, 1(3):96-105, 1982.

The Extendible Cell Method for Closest Point ProblemsMarkku Tamminen. bit, 22(1):27-41, 1982.

Efficient Spatial Access to a Data BaseMarkku Tamminen. SIGMOD 1982: 200-206 [doi]

Extendible Hashing with OverflowMarkku Tamminen. ipl, 15(5):227-232, 1982.

The excell method for efficient geometric access to dataMarkku Tamminen, Reijo Sulonen. dac 1982: 345-351 [doi]

1981

Order Preserving Extendible Hashing and Bucket TriesMarkku Tamminen. bit, 21(4):419-435, 1981.

Sign in or sign up to see more results.

runs on WebDSL