Work

Lower bounds for computing geometric spanners and approximate shortest paths

Year: 2001

Type: article

Source: Discrete Applied Mathematics

DOI: 10.1016/s0166-218x(00)00280-8

Authors: Danny Z. Chen, Gautam Das, Michiel Smid

Institutions: University of Notre Dame, Max Planck Society, Max Planck Institute for Informatics, University of Memphis, Otto-von-Guericke-Universität Magdeburg

Language: English

Topic: Computational Geometry and Mesh Generation

Subfield: Computer Graphics and Computer-Aided Design

Field: Computer Science

Domain: Physical Sciences

Open Access status: bronze

Funder: National Science Foundation

Awards: RIA: Network and Polyhedral Approximations, CAREER: Theoretical and Practical Solutions for Geometric Path Planning and Related Problems

OpenAlex ID: W1552020712

FWCI: 0.54

Cites: 13

Cited by: 22

Related to: 10