Pages that link to "Item:Q1952503"

The following pages link to Computing Steiner points for gradient-constrained minimum networks (Q1952503):

Displaying 10 items.

• Gradient-constrained discounted Steiner trees. I: Optimal tree configurations (Q280980) (← links)
• Gradient-constrained discounted Steiner trees. II: Optimally locating a discounted Steiner point (Q280981) (← links)
• Gradient-constrained minimum networks. II: Labelled or locally minimal Steiner points (Q1024825) (← links)
• On globally minimal Steiner networks with convex boundary points on the plane (Q1423542) (← links)
• Minimal curvature-constrained networks (Q1756754) (← links)
• Exactly solvable and unsolvable shortest network problems in 3D-space (Q1878968) (← links)
• Gradient-constrained minimum networks. III: Fixed topology (Q1934615) (← links)
• Optimum steiner ratio for gradient-constrained networks connecting three points in 3-space, part II: The gradient-constraint m satisfies \documentclass{article} \usepackage{amsmath,amsfonts,amssymb}\pagestyle{empty}\begin{document}$ 1 \leq m \leq \sqrt{3} (Q3087623) (← links)
• Optimum Steiner ratio for gradient‐constrained networks connecting three points in 3‐space, part I (Q5191142) (← links)
• Gradient-constrained minimum networks. I: Fundamentals. (Q5954200) (← links)