Approximate Shortest Paths and Geodesic Diameter on a Convex Polytope in Three Dimensions

Discrete and Computational Geometry - United States
doi 10.1007/pl00009417
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Springer Science and Business Media LLC

Related search

The Power of Quasi-Shortest Paths: Ρ-Geodesic Betweenness Centrality

IEEE Transactions on Network Science and Engineering
ControlComputer NetworksComputer Science ApplicationsSystems EngineeringCommunications
2017English

Stochastic Shortest Paths via Quasi-Convex Maximization

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2006English

Computing Farthest Neighbors on a Convex Polytope

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2001English

The Union of Convex Polyhedra in Three Dimensions

SIAM Journal on Computing
MathematicsComputer Science
1997English

All Pairs Shortest Paths

An Elementary Approach to Design and Analysis of Algorithms
2019English

Asymptotic and Geodesic Bishop Curves in Three Dimensions Minkowski Space E_1^3

Modern Applied Science
2019English

Shortest Gently Descending Paths

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2009English

A Linear Bound on the Diameter of the Transportation Polytope*

Combinatorica
CombinatoricsComputational MathematicsDiscrete Mathematics
2006English

Competition for Shortest Paths on Sparse Graphs

Physical Review Letters
AstronomyPhysics
2012English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2024 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy