scientific article; zbMATH DE number 1444288

zbMATH Open0958.68529MaRDI QIDQ4953330FDOQ4953330

Authors: H. Arsham 

Publication date: 9 May 2000

Title of this publication is not available (Why is that?)

Recommendations

• scientific article; zbMATH DE number 1156645
• Linear programming approaches to the convex hull problem in \(\mathbb{R}^ m\)
• scientific article; zbMATH DE number 724218
• scientific article; zbMATH DE number 1182912

zbMATH Keywords

linear programface identificationbarycenter coordinates of two polygons

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Cited In (15)

• Linearly constrained global optimization: a general solution algorithm with applications.
• Title not available (Why is that?)
• Sublinear geometric algorithms
• Computational Line Geometry
• Computing convex hulls with a linear solver
• Computational and Algorithmic Linear Algebra and n-Dimensional Geometry
• Computational line geometry
• Practical Mixed-Integer Optimization for Geometry Processing
• Locating lines and hyperplanes. Theory and algorithms
• The Geometry of Algorithms with Orthogonality Constraints
• Graph-Theoretic Solutions to Computational Geometry Problems
• Linear programming approaches to the convex hull problem in \(\mathbb{R}^ m\)
• A characterization theorem and an algorithm for a convex hull problem
• An Enumerative Geometry Framework for Algorithmic Line Problems in $\mathbb R^3$
• A computationally stable solution algorithm for linear programs

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