scientific article; zbMATH DE number 3945343

MaRDI QIDQ3716294zbMATH OpenFDO

Authors T. Asano, Masato Edahiro, Masao Iri, Hideki Imai

Publication date 1985

zbMATH Keywords

bucketsminimum-weight perfect matchings in the planepoint locationrange searchshortest paths in networkstwo-dimensional Voronoi diagrams

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Computing methodologies and applications (68U99)

Recommendations

• WORST-CASE ANALYSIS FOR PLANAR MATCHING AND TOUR HEURISTICS WITH BUCKETING TECHNIQUES AND SPACEFILLING CURVES
• scientific article; zbMATH DE number 4037201
• scientific article; zbMATH DE number 3945344
• Geometry helps in bottleneck matching and related problems
• Parallel computational geometry

Cited in

(10)

• A bucketing algorithm for the orthogonal segment intersection search problem and its practical efficiency
• Automatic two- and three-dimensional mesh generation based on fuzzy knowledge processing
• On the randomized construction of the Delaunay tree
• Finite element analyses of three-dimensional fully plastic solutions using quasi-nonsteady algorithm and tetrahedral elements
• Topologically reliable approximation of composite Bézier curves
• New primal and dual matching heuristics
• Representing stereo data with the Delaunay triangulation
• Optimal control of plotting and drilling machines: A case study
• An efficient and numerically correct algorithm for the 2D convex hull problem
• The BOXEL framework for 2.5D data with applications to virtual drivethroughs and ray tracing

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 Q3716294)