- Location
-
Deutsche Nationalbibliothek Frankfurt am Main
- Extent
-
Online-Ressource
- Language
-
Englisch
- Bibliographic citation
-
Minimum Strictly Convex Quadrangulations of Convex Polygons ; 13
Konstanzer Schriften in Mathematik und Informatik ; 13
- Classification
-
Informatik
- Creator
-
Müller-Hannemann, Matthias
Weihe, Karsten
- URN
-
urn:nbn:de:bsz:352-opus-20045
- Rights
-
Der Zugriff auf das Objekt ist unbeschränkt möglich.
- Last update
-
14.08.2025, 10:48 AM CEST
Data provider
This object is provided by:
Deutsche Nationalbibliothek. If you have any questions about the object, please contact the data provider.
Deutsche Nationalbibliothek. If you have any questions about the object, please contact the data provider.
Associated
- Müller-Hannemann, Matthias
- Weihe, Karsten
Other Objects (12)
A general algorithm for convex fair partitions of convex polygons
ON STRICTLY POSITIVE MEASURES AND STRICTLY CONVEX NORMS
ON STRICTLY n-CONVEX NORMED LINEAR SPACES
A strictly feasible sequential convex programming method
Contour approximation by linking locally calculated convex hull polygons
Direct serendipity and mixed finite elements on convex polygons
On Weighted Sums of Numbers of Convex Polygons in Point Sets
On strong orthogonality and strictly convex normed linear spaces
ON THE PRINCIPLE OF UNIFORM BOUNDEDNESS FOR LSC CONVEX PROCESSES IN A STRICTLY N LOCALLY CONVEX SPACES
On Convex Envelopes and Regularization of Non-convex Functionals Without Moving Global Minima
Convex Relaxations of Componentwise Convex Functions
Efficiently Stabbing Convex Polygons and Variants of the Hadwiger-Debrunner (p, q)-Theorem
A general algorithm for convex fair partitions of convex polygons
ON STRICTLY POSITIVE MEASURES AND STRICTLY CONVEX NORMS
ON STRICTLY n-CONVEX NORMED LINEAR SPACES
A strictly feasible sequential convex programming method
Contour approximation by linking locally calculated convex hull polygons
Direct serendipity and mixed finite elements on convex polygons
On Weighted Sums of Numbers of Convex Polygons in Point Sets
On strong orthogonality and strictly convex normed linear spaces
ON THE PRINCIPLE OF UNIFORM BOUNDEDNESS FOR LSC CONVEX PROCESSES IN A STRICTLY N LOCALLY CONVEX SPACES
On Convex Envelopes and Regularization of Non-convex Functionals Without Moving Global Minima
Convex Relaxations of Componentwise Convex Functions
Efficiently Stabbing Convex Polygons and Variants of the Hadwiger-Debrunner (p, q)-Theorem
A general algorithm for convex fair partitions of convex polygons
ON STRICTLY POSITIVE MEASURES AND STRICTLY CONVEX NORMS
ON STRICTLY n-CONVEX NORMED LINEAR SPACES
A strictly feasible sequential convex programming method
Contour approximation by linking locally calculated convex hull polygons
Direct serendipity and mixed finite elements on convex polygons
On Weighted Sums of Numbers of Convex Polygons in Point Sets
On strong orthogonality and strictly convex normed linear spaces
ON THE PRINCIPLE OF UNIFORM BOUNDEDNESS FOR LSC CONVEX PROCESSES IN A STRICTLY N LOCALLY CONVEX SPACES
On Convex Envelopes and Regularization of Non-convex Functionals Without Moving Global Minima
Convex Relaxations of Componentwise Convex Functions