Clustering methods for geometric objects and applications to design problems

DOI10.1007/BF01890985zbMath0641.68130OpenAlexW2021120363MaRDI QIDQ1100929

Frank Dehne, Hartmut Noltemeier

Publication date: 1986

Published in: The Visual Computer (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01890985

zbMATH Keywords

pattern recognitionclusteringVLSIlayout problemscomputational geometryVoronoi tree

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Pattern recognition, speech recognition (68T10)

Related Items (2)

Optical clustering ⋮ Clustering methods for geometric objects and applications to design problems

Cites Work

• Unnamed Item
• Approximations to clustering and subgraph problems on trees
• Efficient algorithms for agglomerative hierarchical clustering methods
• Clustering methods for geometric objects and applications to design problems
• Expected-time complexity results for hierarchic clustering algorithms which use cluster centres
• Generalization of Voronoi Diagrams in the Plane

This page was built for publication: Clustering methods for geometric objects and applications to design problems