Approximating Centroids for the Maximum Intersection of Spherical Polygons

Computer-Aided Design and Applications - United Kingdom
doi 10.1080/16864360.2004.10738311
Full Text
Abstract

Available in full text

Date
Authors
Publisher

CAD Solutions, LLC

Related search

On Asymptotic Algorithms for Approximating Arbitrary Polygons by Simpler Convex Polygons.

English

A Fast Approximation for Maximum Weight Matroid Intersection

2015English

Approximating Maximum Clique With a Hopfield Network

IEEE Transactions on Neural Networks
1995English

Approximating Maximum Uniquely Restricted Matchings in Bipartite Graphs

Discrete Applied Mathematics
CombinatoricsApplied MathematicsDiscrete Mathematics
2019English

Approximating Maximum Leaf Spanning Trees in Almost Linear Time

Journal of Algorithms
1998English

Simulation Model Development for Determination of the Maximum Length of Queued Vehicles on Coordinated Intersection

Technology audit and production reserves
2013English

Dissections of Polygons Into Convex Polygons

International Journal of Computational Geometry and Applications
GeometryApplied MathematicsComputational TheoryComputational MathematicsMathematicsTheoretical Computer ScienceTopology
2010English

On the Geometry of Spatial Polygons and Screw Polygons

Journal of Mechanical Design, Transactions Of the ASME
Computer Science ApplicationsMechanics of MaterialsComputer GraphicsComputer-Aided DesignMechanical Engineering
1997English

The Morphology of Convex Polygons

Computers and Mathematics with Applications
MathematicsComputational MathematicsSimulationModelingComputational Theory
1992English

Amanote Research

Note-taking for researchers

Follow Amanote

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

Privacy PolicyRefund Policy