Upward Point Set Embeddability for Convex Point Sets Is in P

Lecture Notes in Computer Science - Germany
doi 10.1007/978-3-642-25878-7_38
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Springer Berlin Heidelberg

Related search

Further Inequalities for Convex Sets With Lattice Point Constraints in the Plane

Bulletin of the Australian Mathematical Society
Mathematics
1980English

On a Topological Characterization of Compact Convex Point Sets

Proceedings of the National Academy of Sciences of the United States of America
Multidisciplinary
1935English

Affine Invariant Point-Set Matching Using Convex Hull Bisection

2016English

Convex Sets With the Lipschitz Fixed Point Property Are Compact

Proceedings of the American Mathematical Society
MathematicsApplied Mathematics
1985English

Covering Paths for Planar Point Sets

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2013English

Concerning Sets of Segments Which Cover a Point Set in the Vitali Sense

Proceedings of the National Academy of Sciences of the United States of America
Multidisciplinary
1924English

Least $P$th Power Polynomials on a Finite Point Set

Transactions of the American Mathematical Society
MathematicsApplied Mathematics
1956English

Every Lusin Set Is Undetermined in the Point-Open Game

Fundamenta Mathematicae
Number TheoryAlgebra
1994English

Farthest-Point Optimized Point Sets With Maximized Minimum Distance

2011English

Amanote Research

Note-taking for researchers

Follow Amanote

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

Privacy PolicyRefund Policy