---
_id: '9441'
abstract:
- lang: eng
text: "Isomanifolds are the generalization of isosurfaces to arbitrary dimension
and codimension, i.e. submanifolds of ℝ^d defined as the zero set of some multivariate
multivalued smooth function f: ℝ^d → ℝ^{d-n}, where n is the intrinsic dimension
of the manifold. A natural way to approximate a smooth isomanifold M is to consider
its Piecewise-Linear (PL) approximation M̂ based on a triangulation \U0001D4AF
of the ambient space ℝ^d. In this paper, we describe a simple algorithm to trace
isomanifolds from a given starting point. The algorithm works for arbitrary dimensions
n and d, and any precision D. Our main result is that, when f (or M) has bounded
complexity, the complexity of the algorithm is polynomial in d and δ = 1/D (and
unavoidably exponential in n). Since it is known that for δ = Ω (d^{2.5}), M̂
is O(D²)-close and isotopic to M, our algorithm produces a faithful PL-approximation
of isomanifolds of bounded complexity in time polynomial in d. Combining this
algorithm with dimensionality reduction techniques, the dependency on d in the
size of M̂ can be completely removed with high probability. We also show that
the algorithm can handle isomanifolds with boundary and, more generally, isostratifolds.
The algorithm for isomanifolds with boundary has been implemented and experimental
results are reported, showing that it is practical and can handle cases that are
far ahead of the state-of-the-art. "
acknowledgement: We thank Dominique Attali, Guilherme de Fonseca, Arijit Ghosh, Vincent
Pilaud and Aurélien Alvarez for their comments and suggestions. We also acknowledge
the reviewers.
alternative_title:
- LIPIcs
article_processing_charge: No
author:
- first_name: Jean-Daniel
full_name: Boissonnat, Jean-Daniel
last_name: Boissonnat
- first_name: Siargey
full_name: Kachanovich, Siargey
last_name: Kachanovich
- first_name: Mathijs
full_name: Wintraecken, Mathijs
id: 307CFBC8-F248-11E8-B48F-1D18A9856A87
last_name: Wintraecken
orcid: 0000-0002-7472-2220
citation:
ama: 'Boissonnat J-D, Kachanovich S, Wintraecken M. Tracing isomanifolds in Rd in
time polynomial in d using Coxeter-Freudenthal-Kuhn triangulations. In: 37th
International Symposium on Computational Geometry (SoCG 2021). Vol 189. Leibniz
International Proceedings in Informatics (LIPIcs). Dagstuhl, Germany: Schloss
Dagstuhl - Leibniz-Zentrum für Informatik; 2021:17:1-17:16. doi:10.4230/LIPIcs.SoCG.2021.17'
apa: 'Boissonnat, J.-D., Kachanovich, S., & Wintraecken, M. (2021). Tracing
isomanifolds in Rd in time polynomial in d using Coxeter-Freudenthal-Kuhn triangulations.
In 37th International Symposium on Computational Geometry (SoCG 2021) (Vol.
189, p. 17:1-17:16). Dagstuhl, Germany: Schloss Dagstuhl - Leibniz-Zentrum für
Informatik. https://doi.org/10.4230/LIPIcs.SoCG.2021.17'
chicago: 'Boissonnat, Jean-Daniel, Siargey Kachanovich, and Mathijs Wintraecken.
“Tracing Isomanifolds in Rd in Time Polynomial in d Using Coxeter-Freudenthal-Kuhn
Triangulations.” In 37th International Symposium on Computational Geometry
(SoCG 2021), 189:17:1-17:16. Leibniz International Proceedings in Informatics
(LIPIcs). Dagstuhl, Germany: Schloss Dagstuhl - Leibniz-Zentrum für Informatik,
2021. https://doi.org/10.4230/LIPIcs.SoCG.2021.17.'
ieee: J.-D. Boissonnat, S. Kachanovich, and M. Wintraecken, “Tracing isomanifolds
in Rd in time polynomial in d using Coxeter-Freudenthal-Kuhn triangulations,”
in 37th International Symposium on Computational Geometry (SoCG 2021),
Virtual, 2021, vol. 189, p. 17:1-17:16.
ista: 'Boissonnat J-D, Kachanovich S, Wintraecken M. 2021. Tracing isomanifolds
in Rd in time polynomial in d using Coxeter-Freudenthal-Kuhn triangulations. 37th
International Symposium on Computational Geometry (SoCG 2021). SoCG: Symposium
on Computational GeometryLeibniz International Proceedings in Informatics (LIPIcs),
LIPIcs, vol. 189, 17:1-17:16.'
mla: Boissonnat, Jean-Daniel, et al. “Tracing Isomanifolds in Rd in Time Polynomial
in d Using Coxeter-Freudenthal-Kuhn Triangulations.” 37th International Symposium
on Computational Geometry (SoCG 2021), vol. 189, Schloss Dagstuhl - Leibniz-Zentrum
für Informatik, 2021, p. 17:1-17:16, doi:10.4230/LIPIcs.SoCG.2021.17.
short: J.-D. Boissonnat, S. Kachanovich, M. Wintraecken, in:, 37th International
Symposium on Computational Geometry (SoCG 2021), Schloss Dagstuhl - Leibniz-Zentrum
für Informatik, Dagstuhl, Germany, 2021, p. 17:1-17:16.
conference:
end_date: 2021-06-11
location: Virtual
name: 'SoCG: Symposium on Computational Geometry'
start_date: 2021-06-07
date_created: 2021-06-02T10:10:55Z
date_published: 2021-06-02T00:00:00Z
date_updated: 2023-10-10T07:34:34Z
day: '02'
ddc:
- '005'
- '516'
- '514'
department:
- _id: HeEd
doi: 10.4230/LIPIcs.SoCG.2021.17
ec_funded: 1
file:
- access_level: open_access
checksum: c322aa48d5d35a35877896cc565705b6
content_type: application/pdf
creator: mwintrae
date_created: 2021-06-02T10:22:33Z
date_updated: 2021-06-02T10:22:33Z
file_id: '9442'
file_name: LIPIcs-SoCG-2021-17.pdf
file_size: 1972902
relation: main_file
success: 1
file_date_updated: 2021-06-02T10:22:33Z
has_accepted_license: '1'
intvolume: ' 189'
language:
- iso: eng
month: '06'
oa: 1
oa_version: Published Version
page: 17:1-17:16
place: Dagstuhl, Germany
project:
- _id: 260C2330-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '754411'
name: ISTplus - Postdoctoral Fellowships
publication: 37th International Symposium on Computational Geometry (SoCG 2021)
publication_identifier:
isbn:
- 978-3-95977-184-9
issn:
- 1868-8969
publication_status: published
publisher: Schloss Dagstuhl - Leibniz-Zentrum für Informatik
quality_controlled: '1'
related_material:
record:
- id: '12960'
relation: later_version
status: public
series_title: Leibniz International Proceedings in Informatics (LIPIcs)
status: public
title: Tracing isomanifolds in Rd in time polynomial in d using Coxeter-Freudenthal-Kuhn
triangulations
tmp:
image: /images/cc_by.png
legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode
name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)
short: CC BY (4.0)
type: conference
user_id: D865714E-FA4E-11E9-B85B-F5C5E5697425
volume: 189
year: '2021'
...
---
_id: '8338'
abstract:
- lang: eng
text: Canonical parametrisations of classical confocal coordinate systems are introduced
and exploited to construct non-planar analogues of incircular (IC) nets on individual
quadrics and systems of confocal quadrics. Intimate connections with classical
deformations of quadrics that are isometric along asymptotic lines and circular
cross-sections of quadrics are revealed. The existence of octahedral webs of surfaces
of Blaschke type generated by asymptotic and characteristic lines that are diagonally
related to lines of curvature is proved theoretically and established constructively.
Appropriate samplings (grids) of these webs lead to three-dimensional extensions
of non-planar IC nets. Three-dimensional octahedral grids composed of planes and
spatially extending (checkerboard) IC-nets are shown to arise in connection with
systems of confocal quadrics in Minkowski space. In this context, the Laguerre
geometric notion of conical octahedral grids of planes is introduced. The latter
generalise the octahedral grids derived from systems of confocal quadrics in Minkowski
space. An explicit construction of conical octahedral grids is presented. The
results are accompanied by various illustrations which are based on the explicit
formulae provided by the theory.
acknowledgement: This research was supported by the DFG Collaborative Research Center
TRR 109 “Discretization in Geometry and Dynamics”. W.K.S. was also supported by
the Australian Research Council (DP1401000851). A.V.A. was also supported by the
European Research Council (ERC) under the European Union’s Horizon 2020 research
and innovation programme (Grant Agreement No. 78818 Alpha).
article_processing_charge: No
article_type: original
author:
- first_name: Arseniy
full_name: Akopyan, Arseniy
id: 430D2C90-F248-11E8-B48F-1D18A9856A87
last_name: Akopyan
orcid: 0000-0002-2548-617X
- first_name: Alexander I.
full_name: Bobenko, Alexander I.
last_name: Bobenko
- first_name: Wolfgang K.
full_name: Schief, Wolfgang K.
last_name: Schief
- first_name: Jan
full_name: Techter, Jan
last_name: Techter
citation:
ama: Akopyan A, Bobenko AI, Schief WK, Techter J. On mutually diagonal nets on (confocal)
quadrics and 3-dimensional webs. Discrete and Computational Geometry. 2021;66:938-976.
doi:10.1007/s00454-020-00240-w
apa: Akopyan, A., Bobenko, A. I., Schief, W. K., & Techter, J. (2021). On mutually
diagonal nets on (confocal) quadrics and 3-dimensional webs. Discrete and Computational
Geometry. Springer Nature. https://doi.org/10.1007/s00454-020-00240-w
chicago: Akopyan, Arseniy, Alexander I. Bobenko, Wolfgang K. Schief, and Jan Techter.
“On Mutually Diagonal Nets on (Confocal) Quadrics and 3-Dimensional Webs.” Discrete
and Computational Geometry. Springer Nature, 2021. https://doi.org/10.1007/s00454-020-00240-w.
ieee: A. Akopyan, A. I. Bobenko, W. K. Schief, and J. Techter, “On mutually diagonal
nets on (confocal) quadrics and 3-dimensional webs,” Discrete and Computational
Geometry, vol. 66. Springer Nature, pp. 938–976, 2021.
ista: Akopyan A, Bobenko AI, Schief WK, Techter J. 2021. On mutually diagonal nets
on (confocal) quadrics and 3-dimensional webs. Discrete and Computational Geometry.
66, 938–976.
mla: Akopyan, Arseniy, et al. “On Mutually Diagonal Nets on (Confocal) Quadrics
and 3-Dimensional Webs.” Discrete and Computational Geometry, vol. 66,
Springer Nature, 2021, pp. 938–76, doi:10.1007/s00454-020-00240-w.
short: A. Akopyan, A.I. Bobenko, W.K. Schief, J. Techter, Discrete and Computational
Geometry 66 (2021) 938–976.
date_created: 2020-09-06T22:01:13Z
date_published: 2021-10-01T00:00:00Z
date_updated: 2024-03-07T14:51:11Z
day: '01'
department:
- _id: HeEd
doi: 10.1007/s00454-020-00240-w
ec_funded: 1
external_id:
arxiv:
- '1908.00856'
isi:
- '000564488500002'
intvolume: ' 66'
isi: 1
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1908.00856
month: '10'
oa: 1
oa_version: Preprint
page: 938-976
project:
- _id: 266A2E9E-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '788183'
name: Alpha Shape Theory Extended
publication: Discrete and Computational Geometry
publication_identifier:
eissn:
- 1432-0444
issn:
- 0179-5376
publication_status: published
publisher: Springer Nature
quality_controlled: '1'
scopus_import: '1'
status: public
title: On mutually diagonal nets on (confocal) quadrics and 3-dimensional webs
type: journal_article
user_id: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87
volume: 66
year: '2021'
...
---
_id: '8248'
abstract:
- lang: eng
text: 'We consider the following setting: suppose that we are given a manifold M
in Rd with positive reach. Moreover assume that we have an embedded simplical
complex A without boundary, whose vertex set lies on the manifold, is sufficiently
dense and such that all simplices in A have sufficient quality. We prove that
if, locally, interiors of the projection of the simplices onto the tangent space
do not intersect, then A is a triangulation of the manifold, that is, they are
homeomorphic.'
acknowledgement: "Open access funding provided by the Institute of Science and Technology
(IST Austria). Arijit Ghosh is supported by the Ramanujan Fellowship (No. SB/S2/RJN-064/2015),
India.\r\nThis work has been funded by the European Research Council under the European
Union’s ERC Grant Agreement number 339025 GUDHI (Algorithmic Foundations of Geometric
Understanding in Higher Dimensions). The third author is supported by Ramanujan
Fellowship (No. SB/S2/RJN-064/2015), India. The fifth author also received funding
from the European Union’s Horizon 2020 research and innovation programme under the
Marie Skłodowska-Curie Grant Agreement No. 754411."
article_processing_charge: Yes (via OA deal)
article_type: original
author:
- first_name: Jean-Daniel
full_name: Boissonnat, Jean-Daniel
last_name: Boissonnat
- first_name: Ramsay
full_name: Dyer, Ramsay
last_name: Dyer
- first_name: Arijit
full_name: Ghosh, Arijit
last_name: Ghosh
- first_name: Andre
full_name: Lieutier, Andre
last_name: Lieutier
- first_name: Mathijs
full_name: Wintraecken, Mathijs
id: 307CFBC8-F248-11E8-B48F-1D18A9856A87
last_name: Wintraecken
orcid: 0000-0002-7472-2220
citation:
ama: Boissonnat J-D, Dyer R, Ghosh A, Lieutier A, Wintraecken M. Local conditions
for triangulating submanifolds of Euclidean space. Discrete and Computational
Geometry. 2021;66:666-686. doi:10.1007/s00454-020-00233-9
apa: Boissonnat, J.-D., Dyer, R., Ghosh, A., Lieutier, A., & Wintraecken, M.
(2021). Local conditions for triangulating submanifolds of Euclidean space. Discrete
and Computational Geometry. Springer Nature. https://doi.org/10.1007/s00454-020-00233-9
chicago: Boissonnat, Jean-Daniel, Ramsay Dyer, Arijit Ghosh, Andre Lieutier, and
Mathijs Wintraecken. “Local Conditions for Triangulating Submanifolds of Euclidean
Space.” Discrete and Computational Geometry. Springer Nature, 2021. https://doi.org/10.1007/s00454-020-00233-9.
ieee: J.-D. Boissonnat, R. Dyer, A. Ghosh, A. Lieutier, and M. Wintraecken, “Local
conditions for triangulating submanifolds of Euclidean space,” Discrete and
Computational Geometry, vol. 66. Springer Nature, pp. 666–686, 2021.
ista: Boissonnat J-D, Dyer R, Ghosh A, Lieutier A, Wintraecken M. 2021. Local conditions
for triangulating submanifolds of Euclidean space. Discrete and Computational
Geometry. 66, 666–686.
mla: Boissonnat, Jean-Daniel, et al. “Local Conditions for Triangulating Submanifolds
of Euclidean Space.” Discrete and Computational Geometry, vol. 66, Springer
Nature, 2021, pp. 666–86, doi:10.1007/s00454-020-00233-9.
short: J.-D. Boissonnat, R. Dyer, A. Ghosh, A. Lieutier, M. Wintraecken, Discrete
and Computational Geometry 66 (2021) 666–686.
date_created: 2020-08-11T07:11:51Z
date_published: 2021-09-01T00:00:00Z
date_updated: 2024-03-07T14:54:59Z
day: '01'
ddc:
- '510'
department:
- _id: HeEd
doi: 10.1007/s00454-020-00233-9
ec_funded: 1
external_id:
isi:
- '000558119300001'
has_accepted_license: '1'
intvolume: ' 66'
isi: 1
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://doi.org/10.1007/s00454-020-00233-9
month: '09'
oa: 1
oa_version: Published Version
page: 666-686
project:
- _id: 260C2330-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '754411'
name: ISTplus - Postdoctoral Fellowships
publication: Discrete and Computational Geometry
publication_identifier:
eissn:
- 1432-0444
issn:
- 0179-5376
publication_status: published
publisher: Springer Nature
quality_controlled: '1'
scopus_import: '1'
status: public
title: Local conditions for triangulating submanifolds of Euclidean space
tmp:
image: /images/cc_by.png
legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode
name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)
short: CC BY (4.0)
type: journal_article
user_id: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87
volume: 66
year: '2021'
...
---
_id: '7905'
abstract:
- lang: eng
text: We investigate a sheaf-theoretic interpretation of stratification learning
from geometric and topological perspectives. Our main result is the construction
of stratification learning algorithms framed in terms of a sheaf on a partially
ordered set with the Alexandroff topology. We prove that the resulting decomposition
is the unique minimal stratification for which the strata are homogeneous and
the given sheaf is constructible. In particular, when we choose to work with the
local homology sheaf, our algorithm gives an alternative to the local homology
transfer algorithm given in Bendich et al. (Proceedings of the 23rd Annual ACM-SIAM
Symposium on Discrete Algorithms, pp. 1355–1370, ACM, New York, 2012), and the
cohomology stratification algorithm given in Nanda (Found. Comput. Math. 20(2),
195–222, 2020). Additionally, we give examples of stratifications based on the
geometric techniques of Breiding et al. (Rev. Mat. Complut. 31(3), 545–593, 2018),
illustrating how the sheaf-theoretic approach can be used to study stratifications
from both topological and geometric perspectives. This approach also points toward
future applications of sheaf theory in the study of topological data analysis
by illustrating the utility of the language of sheaf theory in generalizing existing
algorithms.
acknowledgement: Open access funding provided by Institute of Science and Technology
(IST Austria). This work was partially supported by NSF IIS-1513616 and NSF ABI-1661375.
The authors would like to thank the anonymous referees for their insightful comments.
article_processing_charge: Yes (via OA deal)
article_type: original
author:
- first_name: Adam
full_name: Brown, Adam
id: 70B7FDF6-608D-11E9-9333-8535E6697425
last_name: Brown
- first_name: Bei
full_name: Wang, Bei
last_name: Wang
citation:
ama: Brown A, Wang B. Sheaf-theoretic stratification learning from geometric and
topological perspectives. Discrete and Computational Geometry. 2021;65:1166-1198.
doi:10.1007/s00454-020-00206-y
apa: Brown, A., & Wang, B. (2021). Sheaf-theoretic stratification learning from
geometric and topological perspectives. Discrete and Computational Geometry.
Springer Nature. https://doi.org/10.1007/s00454-020-00206-y
chicago: Brown, Adam, and Bei Wang. “Sheaf-Theoretic Stratification Learning from
Geometric and Topological Perspectives.” Discrete and Computational Geometry.
Springer Nature, 2021. https://doi.org/10.1007/s00454-020-00206-y.
ieee: A. Brown and B. Wang, “Sheaf-theoretic stratification learning from geometric
and topological perspectives,” Discrete and Computational Geometry, vol.
65. Springer Nature, pp. 1166–1198, 2021.
ista: Brown A, Wang B. 2021. Sheaf-theoretic stratification learning from geometric
and topological perspectives. Discrete and Computational Geometry. 65, 1166–1198.
mla: Brown, Adam, and Bei Wang. “Sheaf-Theoretic Stratification Learning from Geometric
and Topological Perspectives.” Discrete and Computational Geometry, vol.
65, Springer Nature, 2021, pp. 1166–98, doi:10.1007/s00454-020-00206-y.
short: A. Brown, B. Wang, Discrete and Computational Geometry 65 (2021) 1166–1198.
date_created: 2020-05-30T10:26:04Z
date_published: 2021-06-01T00:00:00Z
date_updated: 2024-03-07T15:01:58Z
day: '01'
ddc:
- '510'
department:
- _id: HeEd
doi: 10.1007/s00454-020-00206-y
external_id:
arxiv:
- '1712.07734'
isi:
- '000536324700001'
file:
- access_level: open_access
checksum: 487a84ea5841b75f04f66d7ebd71b67e
content_type: application/pdf
creator: dernst
date_created: 2020-11-25T09:06:41Z
date_updated: 2020-11-25T09:06:41Z
file_id: '8803'
file_name: 2020_DiscreteCompGeometry_Brown.pdf
file_size: 1013730
relation: main_file
success: 1
file_date_updated: 2020-11-25T09:06:41Z
has_accepted_license: '1'
intvolume: ' 65'
isi: 1
language:
- iso: eng
month: '06'
oa: 1
oa_version: Published Version
page: 1166-1198
project:
- _id: B67AFEDC-15C9-11EA-A837-991A96BB2854
name: IST Austria Open Access Fund
publication: Discrete and Computational Geometry
publication_identifier:
eissn:
- 1432-0444
issn:
- 0179-5376
publication_status: published
publisher: Springer Nature
quality_controlled: '1'
scopus_import: '1'
status: public
title: Sheaf-theoretic stratification learning from geometric and topological perspectives
tmp:
image: /images/cc_by.png
legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode
name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)
short: CC BY (4.0)
type: journal_article
user_id: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87
volume: 65
year: '2021'
...
---
_id: '7567'
abstract:
- lang: eng
text: Coxeter triangulations are triangulations of Euclidean space based on a single
simplex. By this we mean that given an individual simplex we can recover the entire
triangulation of Euclidean space by inductively reflecting in the faces of the
simplex. In this paper we establish that the quality of the simplices in all Coxeter
triangulations is O(1/d−−√) of the quality of regular simplex. We further investigate
the Delaunay property for these triangulations. Moreover, we consider an extension
of the Delaunay property, namely protection, which is a measure of non-degeneracy
of a Delaunay triangulation. In particular, one family of Coxeter triangulations
achieves the protection O(1/d2). We conjecture that both bounds are optimal for
triangulations in Euclidean space.
article_processing_charge: Yes (via OA deal)
article_type: original
author:
- first_name: Aruni
full_name: Choudhary, Aruni
last_name: Choudhary
- first_name: Siargey
full_name: Kachanovich, Siargey
last_name: Kachanovich
- first_name: Mathijs
full_name: Wintraecken, Mathijs
id: 307CFBC8-F248-11E8-B48F-1D18A9856A87
last_name: Wintraecken
orcid: 0000-0002-7472-2220
citation:
ama: Choudhary A, Kachanovich S, Wintraecken M. Coxeter triangulations have good
quality. Mathematics in Computer Science. 2020;14:141-176. doi:10.1007/s11786-020-00461-5
apa: Choudhary, A., Kachanovich, S., & Wintraecken, M. (2020). Coxeter triangulations
have good quality. Mathematics in Computer Science. Springer Nature. https://doi.org/10.1007/s11786-020-00461-5
chicago: Choudhary, Aruni, Siargey Kachanovich, and Mathijs Wintraecken. “Coxeter
Triangulations Have Good Quality.” Mathematics in Computer Science. Springer
Nature, 2020. https://doi.org/10.1007/s11786-020-00461-5.
ieee: A. Choudhary, S. Kachanovich, and M. Wintraecken, “Coxeter triangulations
have good quality,” Mathematics in Computer Science, vol. 14. Springer
Nature, pp. 141–176, 2020.
ista: Choudhary A, Kachanovich S, Wintraecken M. 2020. Coxeter triangulations have
good quality. Mathematics in Computer Science. 14, 141–176.
mla: Choudhary, Aruni, et al. “Coxeter Triangulations Have Good Quality.” Mathematics
in Computer Science, vol. 14, Springer Nature, 2020, pp. 141–76, doi:10.1007/s11786-020-00461-5.
short: A. Choudhary, S. Kachanovich, M. Wintraecken, Mathematics in Computer Science
14 (2020) 141–176.
date_created: 2020-03-05T13:30:18Z
date_published: 2020-03-01T00:00:00Z
date_updated: 2021-01-12T08:14:13Z
day: '01'
ddc:
- '510'
department:
- _id: HeEd
doi: 10.1007/s11786-020-00461-5
ec_funded: 1
file:
- access_level: open_access
checksum: 1d145f3ab50ccee735983cb89236e609
content_type: application/pdf
creator: dernst
date_created: 2020-11-20T10:18:02Z
date_updated: 2020-11-20T10:18:02Z
file_id: '8783'
file_name: 2020_MathCompScie_Choudhary.pdf
file_size: 872275
relation: main_file
success: 1
file_date_updated: 2020-11-20T10:18:02Z
has_accepted_license: '1'
intvolume: ' 14'
language:
- iso: eng
month: '03'
oa: 1
oa_version: Published Version
page: 141-176
project:
- _id: B67AFEDC-15C9-11EA-A837-991A96BB2854
name: IST Austria Open Access Fund
- _id: 260C2330-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '754411'
name: ISTplus - Postdoctoral Fellowships
publication: Mathematics in Computer Science
publication_identifier:
eissn:
- 1661-8289
issn:
- 1661-8270
publication_status: published
publisher: Springer Nature
quality_controlled: '1'
scopus_import: '1'
status: public
title: Coxeter triangulations have good quality
tmp:
image: /images/cc_by.png
legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode
name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)
short: CC BY (4.0)
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 14
year: '2020'
...