scientific article; zbMATH DE number 3938571
From MaRDI portal
Publication:3709898
algorithmsareaclosest paircomplexitycomplexity measurecomputational complexitycomputational geometryconvex hullDelaunay triangulationdiameterdistancefurthest neighbour graphlower boundsminimum spanning treemodel of VLSI-computationnearest neighbour graphrelative neighbourhood graphtimeupper boundsVLSI
Recommendations
- VLSI systems for some problems of computational geometry
- An efficient VLSI architecture with applications to geometric problems
- scientific article; zbMATH DE number 3869221
- VLSI circuit performance optimization by geometric programming
- Geometry of synthesis: a structured approach to VLSI design
- scientific article; zbMATH DE number 139786
- scientific article; zbMATH DE number 4066315
- Some combinatorial optimization problems arising from VLSI circuit design
- scientific article; zbMATH DE number 833244
Cited in
(5)- VLSI systems for some problems of computational geometry
- An efficient VLSI architecture with applications to geometric problems
- scientific article; zbMATH DE number 4066315 (Why is no real title available?)
- Parallel computation of discrete Voronoi diagrams (extended abstract)
- On the density and discrepancy of a 2D point set with applications to thermal analysis of VLSI chips
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3709898)
