---
_id: '14888'
abstract:
- lang: eng
text: 'A face in a curve arrangement is called popular if it is bounded by the same
curve multiple times. Motivated by the automatic generation of curved nonogram
puzzles, we investigate possibilities to eliminate the popular faces in an arrangement
by inserting a single additional curve. This turns out to be NP-hard; however,
it becomes tractable when the number of popular faces is small: We present a probabilistic
FPT-approach in the number of popular faces.'
acknowledgement: 'This work was initiated at the 16th European Research Week on Geometric
Graphs in Strobl in 2019. A.W. is supported by the Austrian Science Fund (FWF):
W1230. S.T. has been funded by the Vienna Science and Technology Fund (WWTF) [10.47379/ICT19035].
A preliminary version of this work has been presented at the 38th European Workshop
on Computational Geometry (EuroCG 2022) in Perugia [9]. A full version of this paper,
which includes appendices but is otherwise identical, is available as a technical
report [10].'
alternative_title:
- LNCS
article_processing_charge: No
author:
- first_name: Phoebe
full_name: De Nooijer, Phoebe
last_name: De Nooijer
- first_name: Soeren
full_name: Terziadis, Soeren
last_name: Terziadis
- first_name: Alexandra
full_name: Weinberger, Alexandra
last_name: Weinberger
- first_name: Zuzana
full_name: Masárová, Zuzana
id: 45CFE238-F248-11E8-B48F-1D18A9856A87
last_name: Masárová
orcid: 0000-0002-6660-1322
- first_name: Tamara
full_name: Mchedlidze, Tamara
last_name: Mchedlidze
- first_name: Maarten
full_name: Löffler, Maarten
last_name: Löffler
- first_name: Günter
full_name: Rote, Günter
last_name: Rote
citation:
ama: 'De Nooijer P, Terziadis S, Weinberger A, et al. Removing popular faces in curve
arrangements. In: 31st International Symposium on Graph Drawing and Network
Visualization. Vol 14466. Springer Nature; 2024:18-33. doi:10.1007/978-3-031-49275-4_2'
apa: 'De Nooijer, P., Terziadis, S., Weinberger, A., Masárová, Z., Mchedlidze, T.,
Löffler, M., & Rote, G. (2024). Removing popular faces in curve arrangements.
In 31st International Symposium on Graph Drawing and Network Visualization
(Vol. 14466, pp. 18–33). Isola delle Femmine, Palermo, Italy: Springer Nature.
https://doi.org/10.1007/978-3-031-49275-4_2'
chicago: De Nooijer, Phoebe, Soeren Terziadis, Alexandra Weinberger, Zuzana Masárová,
Tamara Mchedlidze, Maarten Löffler, and Günter Rote. “Removing Popular Faces in Curve
Arrangements.” In 31st International Symposium on Graph Drawing and Network
Visualization, 14466:18–33. Springer Nature, 2024. https://doi.org/10.1007/978-3-031-49275-4_2.
ieee: P. De Nooijer et al., “Removing popular faces in curve arrangements,”
in 31st International Symposium on Graph Drawing and Network Visualization,
Isola delle Femmine, Palermo, Italy, 2024, vol. 14466, pp. 18–33.
ista: 'De Nooijer P, Terziadis S, Weinberger A, Masárová Z, Mchedlidze T, Löffler
M, Rote G. 2024. Removing popular faces in curve arrangements. 31st International
Symposium on Graph Drawing and Network Visualization. GD: Graph Drawing and Network
Visualization, LNCS, vol. 14466, 18–33.'
mla: De Nooijer, Phoebe, et al. “Removing Popular Faces in Curve Arrangements.”
31st International Symposium on Graph Drawing and Network Visualization,
vol. 14466, Springer Nature, 2024, pp. 18–33, doi:10.1007/978-3-031-49275-4_2.
short: P. De Nooijer, S. Terziadis, A. Weinberger, Z. Masárová, T. Mchedlidze, M.
Löffler, G. Rote, in:, 31st International Symposium on Graph Drawing and Network
Visualization, Springer Nature, 2024, pp. 18–33.
conference:
end_date: 2023-09-22
location: Isola delle Femmine, Palermo, Italy
name: 'GD: Graph Drawing and Network Visualization'
start_date: 2023-09-20
date_created: 2024-01-28T23:01:43Z
date_published: 2024-01-06T00:00:00Z
date_updated: 2024-01-29T09:45:06Z
day: '06'
department:
- _id: UlWa
- _id: HeEd
doi: 10.1007/978-3-031-49275-4_2
external_id:
arxiv:
- '2202.12175'
intvolume: ' 14466'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://doi.org/10.48550/arXiv.2202.12175
month: '01'
oa: 1
oa_version: Preprint
page: 18-33
publication: 31st International Symposium on Graph Drawing and Network Visualization
publication_identifier:
eissn:
- 1611-3349
isbn:
- '9783031492747'
issn:
- 0302-9743
publication_status: published
publisher: Springer Nature
quality_controlled: '1'
scopus_import: '1'
status: public
title: Removing popular faces in curve arrangements
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 14466
year: '2024'
...
---
_id: '15012'
abstract:
- lang: eng
text: We solve a problem of Dujmović and Wood (2007) by showing that a complete
convex geometric graph on n vertices cannot be decomposed into fewer than n-1
star-forests, each consisting of noncrossing edges. This bound is clearly tight.
We also discuss similar questions for abstract graphs.
acknowledgement: János Pach’s Research partially supported by European Research Council
(ERC), grant “GeoScape” No. 882971 and by the Hungarian Science Foundation (NKFIH),
grant K-131529. Work by Morteza Saghafian is partially supported by the European
Research Council (ERC), grant No. 788183, and by the Wittgenstein Prize, Austrian
Science Fund (FWF), grant No. Z 342-N31.
alternative_title:
- LNCS
article_processing_charge: No
author:
- first_name: János
full_name: Pach, János
id: E62E3130-B088-11EA-B919-BF823C25FEA4
last_name: Pach
- first_name: Morteza
full_name: Saghafian, Morteza
id: f86f7148-b140-11ec-9577-95435b8df824
last_name: Saghafian
- first_name: Patrick
full_name: Schnider, Patrick
last_name: Schnider
citation:
ama: 'Pach J, Saghafian M, Schnider P. Decomposition of geometric graphs into star-forests.
In: 31st International Symposium on Graph Drawing and Network Visualization.
Vol 14465. Springer Nature; 2024:339-346. doi:10.1007/978-3-031-49272-3_23'
apa: 'Pach, J., Saghafian, M., & Schnider, P. (2024). Decomposition of geometric
graphs into star-forests. In 31st International Symposium on Graph Drawing
and Network Visualization (Vol. 14465, pp. 339–346). Isola delle Femmine,
Palermo, Italy: Springer Nature. https://doi.org/10.1007/978-3-031-49272-3_23'
chicago: Pach, János, Morteza Saghafian, and Patrick Schnider. “Decomposition of Geometric
Graphs into Star-Forests.” In 31st International Symposium on Graph Drawing
and Network Visualization, 14465:339–46. Springer Nature, 2024. https://doi.org/10.1007/978-3-031-49272-3_23.
ieee: J. Pach, M. Saghafian, and P. Schnider, “Decomposition of geometric graphs
into star-forests,” in 31st International Symposium on Graph Drawing and Network
Visualization, Isola delle Femmine, Palermo, Italy, 2024, vol. 14465, pp.
339–346.
ista: 'Pach J, Saghafian M, Schnider P. 2024. Decomposition of geometric graphs
into star-forests. 31st International Symposium on Graph Drawing and Network Visualization.
GD: Graph Drawing and Network Visualization, LNCS, vol. 14465, 339–346.'
mla: Pach, János, et al. “Decomposition of Geometric Graphs into Star-Forests.”
31st International Symposium on Graph Drawing and Network Visualization,
vol. 14465, Springer Nature, 2024, pp. 339–46, doi:10.1007/978-3-031-49272-3_23.
short: J. Pach, M. Saghafian, P. Schnider, in:, 31st International Symposium on
Graph Drawing and Network Visualization, Springer Nature, 2024, pp. 339–346.
conference:
end_date: 2023-09-22
location: Isola delle Femmine, Palermo, Italy
name: 'GD: Graph Drawing and Network Visualization'
start_date: 2023-09-20
date_created: 2024-02-18T23:01:03Z
date_published: 2024-01-01T00:00:00Z
date_updated: 2024-02-20T09:13:07Z
day: '01'
department:
- _id: HeEd
doi: 10.1007/978-3-031-49272-3_23
ec_funded: 1
external_id:
arxiv:
- '2306.13201'
intvolume: ' 14465'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://doi.org/10.48550/arXiv.2306.13201
month: '01'
oa: 1
oa_version: Preprint
page: 339-346
project:
- _id: 266A2E9E-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '788183'
name: Alpha Shape Theory Extended
- _id: 268116B8-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: Z00342
name: The Wittgenstein Prize
publication: 31st International Symposium on Graph Drawing and Network Visualization
publication_identifier:
eissn:
- '16113349'
isbn:
- '9783031492716'
issn:
- '03029743'
publication_status: published
publisher: Springer Nature
quality_controlled: '1'
scopus_import: '1'
status: public
title: Decomposition of geometric graphs into star-forests
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 14465
year: '2024'
...
---
_id: '15094'
abstract:
- lang: eng
text: "Point sets, geometric networks, and arrangements of hyperplanes are fundamental
objects in\r\ndiscrete geometry that have captivated mathematicians for centuries,
if not millennia. This\r\nthesis seeks to cast new light on these structures by
illustrating specific instances where a\r\ntopological perspective, specifically
through discrete Morse theory and persistent homology,\r\nprovides valuable insights.\r\n\r\nAt
first glance, the topology of these geometric objects might seem uneventful: point
sets\r\nessentially lack of topology, arrangements of hyperplanes are a decomposition
of Rd, which\r\nis a contractible space, and the topology of a network primarily
involves the enumeration\r\nof connected components and cycles within the network.
However, beneath this apparent\r\nsimplicity, there lies an array of intriguing
structures, a small subset of which will be uncovered\r\nin this thesis.\r\n\r\nFocused
on three case studies, each addressing one of the mentioned objects, this work\r\nwill
showcase connections that intertwine topology with diverse fields such as combinatorial\r\ngeometry,
algorithms and data structures, and emerging applications like spatial biology.\r\n\r\n"
alternative_title:
- ISTA Thesis
article_processing_charge: No
author:
- first_name: Sebastiano
full_name: Cultrera di Montesano, Sebastiano
id: 34D2A09C-F248-11E8-B48F-1D18A9856A87
last_name: Cultrera di Montesano
orcid: 0000-0001-6249-0832
citation:
ama: Cultrera di Montesano S. Persistence and Morse theory for discrete geometric
structures. 2024. doi:10.15479/at:ista:15094
apa: Cultrera di Montesano, S. (2024). Persistence and Morse theory for discrete
geometric structures. Institute of Science and Technology Austria. https://doi.org/10.15479/at:ista:15094
chicago: Cultrera di Montesano, Sebastiano. “Persistence and Morse Theory for Discrete
Geometric Structures.” Institute of Science and Technology Austria, 2024. https://doi.org/10.15479/at:ista:15094.
ieee: S. Cultrera di Montesano, “Persistence and Morse theory for discrete geometric
structures,” Institute of Science and Technology Austria, 2024.
ista: Cultrera di Montesano S. 2024. Persistence and Morse theory for discrete geometric
structures. Institute of Science and Technology Austria.
mla: Cultrera di Montesano, Sebastiano. Persistence and Morse Theory for Discrete
Geometric Structures. Institute of Science and Technology Austria, 2024, doi:10.15479/at:ista:15094.
short: S. Cultrera di Montesano, Persistence and Morse Theory for Discrete Geometric
Structures, Institute of Science and Technology Austria, 2024.
date_created: 2024-03-08T15:28:10Z
date_published: 2024-03-08T00:00:00Z
date_updated: 2024-03-20T09:36:57Z
day: '08'
ddc:
- '514'
- '500'
- '516'
degree_awarded: PhD
department:
- _id: GradSch
- _id: HeEd
doi: 10.15479/at:ista:15094
ec_funded: 1
file:
- access_level: open_access
checksum: 1e468bfa42a7dcf04d89f4dadc621c87
content_type: application/pdf
creator: scultrer
date_created: 2024-03-14T08:55:07Z
date_updated: 2024-03-14T08:55:07Z
file_id: '15112'
file_name: Thesis Sebastiano.pdf
file_size: 4106872
relation: main_file
success: 1
- access_level: closed
checksum: bcbd213490f5a7e68855a092bbce93f1
content_type: application/zip
creator: scultrer
date_created: 2024-03-14T08:56:24Z
date_updated: 2024-03-14T14:14:35Z
file_id: '15113'
file_name: Thesis (1).zip
file_size: 4746234
relation: source_file
file_date_updated: 2024-03-14T14:14:35Z
has_accepted_license: '1'
language:
- iso: eng
month: '03'
oa: 1
oa_version: Published Version
page: '108'
project:
- _id: 266A2E9E-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '788183'
name: Alpha Shape Theory Extended
- _id: 268116B8-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: Z00342
name: The Wittgenstein Prize
- _id: 0aa4bc98-070f-11eb-9043-e6fff9c6a316
grant_number: I4887
name: Discretization in Geometry and Dynamics
- _id: 2561EBF4-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: I02979-N35
name: Persistence and stability of geometric complexes
publication_identifier:
issn:
- 2663 - 337X
publication_status: published
publisher: Institute of Science and Technology Austria
related_material:
record:
- id: '11660'
relation: part_of_dissertation
status: public
- id: '11658'
relation: part_of_dissertation
status: public
- id: '13182'
relation: part_of_dissertation
status: public
- id: '15090'
relation: part_of_dissertation
status: public
- id: '15091'
relation: part_of_dissertation
status: public
- id: '15093'
relation: part_of_dissertation
status: public
status: public
supervisor:
- first_name: Herbert
full_name: Edelsbrunner, Herbert
id: 3FB178DA-F248-11E8-B48F-1D18A9856A87
last_name: Edelsbrunner
orcid: 0000-0002-9823-6833
title: Persistence and Morse theory for discrete geometric structures
tmp:
image: /images/cc_by_nc_sa.png
legal_code_url: https://creativecommons.org/licenses/by-nc-sa/4.0/legalcode
name: Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International (CC
BY-NC-SA 4.0)
short: CC BY-NC-SA (4.0)
type: dissertation
user_id: 8b945eb4-e2f2-11eb-945a-df72226e66a9
year: '2024'
...
---
_id: '15093'
abstract:
- lang: eng
text: We present a dynamic data structure for maintaining the persistent homology
of a time series of real numbers. The data structure supports local operations,
including the insertion and deletion of an item and the cutting and concatenating
of lists, each in time O(log n + k), in which n counts the critical items and
k the changes in the augmented persistence diagram. To achieve this, we design
a tailor-made tree structure with an unconventional representation, referred to
as banana tree, which may be useful in its own right.
acknowledgement: The first and second authors are funded by the European Research Council under the
European Union’s Horizon 2020 research and innovation programme, ERC grant no. 788183,“Alpha
Shape Theory Extended (Alpha)”, by the Wittgenstein Prize, FWF grant no. Z 342-N31,
and by the DFG Collaborative Research Center TRR 109, FWF grant no. I 02979-N35.The
third author received funding by the European Research Council under the European
Union’s Horizon 2020research and innovation programme, ERC grant no. 101019564, “The Design of Modern Fully Dynamic DataStructures
(MoDynStruct)”, and by the Austrian Science Fund through the Wittgenstein Prize
with FWF grant no. Z 422-N, and also by FWF grant no. I 5982-N, and by FWF grant
no. P 33775-N, with additional funding from the netidee SCIENCE Stiftung, 2020–2024. The
fourth author is funded by the Vienna Graduate School on Computational Optimization,
FWF project no. W1260-N35.
article_processing_charge: No
author:
- first_name: Sebastiano
full_name: Cultrera di Montesano, Sebastiano
id: 34D2A09C-F248-11E8-B48F-1D18A9856A87
last_name: Cultrera di Montesano
orcid: 0000-0001-6249-0832
- first_name: Herbert
full_name: Edelsbrunner, Herbert
id: 3FB178DA-F248-11E8-B48F-1D18A9856A87
last_name: Edelsbrunner
orcid: 0000-0002-9823-6833
- first_name: Monika H
full_name: Henzinger, Monika H
id: 540c9bbd-f2de-11ec-812d-d04a5be85630
last_name: Henzinger
orcid: 0000-0002-5008-6530
- first_name: Lara
full_name: Ost, Lara
last_name: Ost
citation:
ama: 'Cultrera di Montesano S, Edelsbrunner H, Henzinger MH, Ost L. Dynamically
maintaining the persistent homology of time series. In: Woodruff DP, ed. Proceedings
of the 2024 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA). Society
for Industrial and Applied Mathematics; 2024:243-295. doi:10.1137/1.9781611977912.11'
apa: 'Cultrera di Montesano, S., Edelsbrunner, H., Henzinger, M. H., & Ost,
L. (2024). Dynamically maintaining the persistent homology of time series. In
D. P. Woodruff (Ed.), Proceedings of the 2024 Annual ACM-SIAM Symposium on
Discrete Algorithms (SODA) (pp. 243–295). Alexandria, VA, USA: Society for
Industrial and Applied Mathematics. https://doi.org/10.1137/1.9781611977912.11'
chicago: Cultrera di Montesano, Sebastiano, Herbert Edelsbrunner, Monika H Henzinger,
and Lara Ost. “Dynamically Maintaining the Persistent Homology of Time Series.”
In Proceedings of the 2024 Annual ACM-SIAM Symposium on Discrete Algorithms
(SODA), edited by David P. Woodruff, 243–95. Society for Industrial and Applied
Mathematics, 2024. https://doi.org/10.1137/1.9781611977912.11.
ieee: S. Cultrera di Montesano, H. Edelsbrunner, M. H. Henzinger, and L. Ost, “Dynamically
maintaining the persistent homology of time series,” in Proceedings of the
2024 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), Alexandria,
VA, USA, 2024, pp. 243–295.
ista: 'Cultrera di Montesano S, Edelsbrunner H, Henzinger MH, Ost L. 2024. Dynamically
maintaining the persistent homology of time series. Proceedings of the 2024 Annual
ACM-SIAM Symposium on Discrete Algorithms (SODA). SODA: Symposium on Discrete
Algorigthms, 243–295.'
mla: Cultrera di Montesano, Sebastiano, et al. “Dynamically Maintaining the Persistent
Homology of Time Series.” Proceedings of the 2024 Annual ACM-SIAM Symposium
on Discrete Algorithms (SODA), edited by David P. Woodruff, Society for Industrial
and Applied Mathematics, 2024, pp. 243–95, doi:10.1137/1.9781611977912.11.
short: S. Cultrera di Montesano, H. Edelsbrunner, M.H. Henzinger, L. Ost, in:, D.P.
Woodruff (Ed.), Proceedings of the 2024 Annual ACM-SIAM Symposium on Discrete
Algorithms (SODA), Society for Industrial and Applied Mathematics, 2024, pp. 243–295.
conference:
end_date: 2024-01-10
location: Alexandria, VA, USA
name: 'SODA: Symposium on Discrete Algorigthms'
start_date: 2024-01-07
date_created: 2024-03-08T10:27:39Z
date_published: 2024-01-04T00:00:00Z
date_updated: 2024-03-20T09:36:56Z
day: '04'
department:
- _id: HeEd
- _id: MoHe
doi: 10.1137/1.9781611977912.11
ec_funded: 1
editor:
- first_name: David P.
full_name: Woodruff, David P.
last_name: Woodruff
external_id:
arxiv:
- '2311.01115'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/2311.01115
month: '01'
oa: 1
oa_version: Preprint
page: 243 - 295
project:
- _id: 266A2E9E-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '788183'
name: Alpha Shape Theory Extended
- _id: 268116B8-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: Z00342
name: The Wittgenstein Prize
- _id: bd9ca328-d553-11ed-ba76-dc4f890cfe62
call_identifier: H2020
grant_number: '101019564'
name: The design and evaluation of modern fully dynamic data structures
- _id: 34def286-11ca-11ed-8bc3-da5948e1613c
grant_number: Z00422
name: Wittgenstein Award - Monika Henzinger
- _id: bd9e3a2e-d553-11ed-ba76-8aa684ce17fe
grant_number: 'P33775 '
name: Fast Algorithms for a Reactive Network Layer
publication: Proceedings of the 2024 Annual ACM-SIAM Symposium on Discrete Algorithms
(SODA)
publication_identifier:
eisbn:
- '9781611977912'
publication_status: published
publisher: Society for Industrial and Applied Mathematics
quality_controlled: '1'
related_material:
record:
- id: '15094'
relation: dissertation_contains
status: public
status: public
title: Dynamically maintaining the persistent homology of time series
type: conference
user_id: 8b945eb4-e2f2-11eb-945a-df72226e66a9
year: '2024'
...
---
_id: '15091'
abstract:
- lang: eng
text: "Motivated by applications in the medical sciences, we study finite chromatic\r\nsets
in Euclidean space from a topological perspective. Based on the persistent\r\nhomology
for images, kernels and cokernels, we design provably stable\r\nhomological quantifiers
that describe the geometric micro- and macro-structure\r\nof how the color classes
mingle. These can be efficiently computed using\r\nchromatic variants of Delaunay
and alpha complexes, and code that does these\r\ncomputations is provided."
article_number: '2212.03128'
article_processing_charge: No
author:
- first_name: Sebastiano
full_name: Cultrera di Montesano, Sebastiano
id: 34D2A09C-F248-11E8-B48F-1D18A9856A87
last_name: Cultrera di Montesano
orcid: 0000-0001-6249-0832
- first_name: Ondrej
full_name: Draganov, Ondrej
id: 2B23F01E-F248-11E8-B48F-1D18A9856A87
last_name: Draganov
- first_name: Herbert
full_name: Edelsbrunner, Herbert
id: 3FB178DA-F248-11E8-B48F-1D18A9856A87
last_name: Edelsbrunner
orcid: 0000-0002-9823-6833
- first_name: Morteza
full_name: Saghafian, Morteza
id: f86f7148-b140-11ec-9577-95435b8df824
last_name: Saghafian
citation:
ama: Cultrera di Montesano S, Draganov O, Edelsbrunner H, Saghafian M. Chromatic
alpha complexes. arXiv.
apa: Cultrera di Montesano, S., Draganov, O., Edelsbrunner, H., & Saghafian,
M. (n.d.). Chromatic alpha complexes. arXiv.
chicago: Cultrera di Montesano, Sebastiano, Ondrej Draganov, Herbert Edelsbrunner,
and Morteza Saghafian. “Chromatic Alpha Complexes.” ArXiv, n.d.
ieee: S. Cultrera di Montesano, O. Draganov, H. Edelsbrunner, and M. Saghafian,
“Chromatic alpha complexes,” arXiv. .
ista: Cultrera di Montesano S, Draganov O, Edelsbrunner H, Saghafian M. Chromatic
alpha complexes. arXiv, 2212.03128.
mla: Cultrera di Montesano, Sebastiano, et al. “Chromatic Alpha Complexes.” ArXiv,
2212.03128.
short: S. Cultrera di Montesano, O. Draganov, H. Edelsbrunner, M. Saghafian, ArXiv
(n.d.).
date_created: 2024-03-08T10:13:59Z
date_published: 2024-02-07T00:00:00Z
date_updated: 2024-03-20T09:36:56Z
day: '07'
department:
- _id: HeEd
external_id:
arxiv:
- '2212.03128'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/2212.03128
month: '02'
oa: 1
oa_version: Preprint
publication: arXiv
publication_status: submitted
related_material:
record:
- id: '15094'
relation: dissertation_contains
status: public
status: public
title: Chromatic alpha complexes
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: preprint
user_id: 8b945eb4-e2f2-11eb-945a-df72226e66a9
year: '2024'
...
---
_id: '13048'
abstract:
- lang: eng
text: In this paper we introduce a pruning of the medial axis called the (λ,α)-medial
axis (axλα). We prove that the (λ,α)-medial axis of a set K is stable in a Gromov-Hausdorff
sense under weak assumptions. More formally we prove that if K and K′ are close
in the Hausdorff (dH) sense then the (λ,α)-medial axes of K and K′ are close as
metric spaces, that is the Gromov-Hausdorff distance (dGH) between the two is
1/4-Hölder in the sense that dGH (axλα(K),axλα(K′)) ≲ dH(K,K′)1/4. The Hausdorff
distance between the two medial axes is also bounded, by dH (axλα(K),λα(K′)) ≲
dH(K,K′)1/2. These quantified stability results provide guarantees for practical
computations of medial axes from approximations. Moreover, they provide key ingredients
for studying the computability of the medial axis in the context of computable
analysis.
acknowledgement: "We are greatly indebted to Erin Chambers for posing a number of
questions that eventually led to this paper. We would also like to thank the other
organizers of the workshop on ‘Algorithms\r\nfor the medial axis’. We are also indebted
to Tatiana Ezubova for helping with the search for and translation of Russian literature.
The second author thanks all members of the Edelsbrunner and Datashape groups for
the atmosphere in which the research was conducted.\r\nThe research leading to these
results has received funding from the European Research Council (ERC) under the
European Union’s Seventh Framework Programme (FP/2007-2013) / ERC Grant Agreement
No. 339025 GUDHI (Algorithmic Foundations of Geometry Understanding in Higher Dimensions).
Supported by the European Union’s Horizon 2020 research and innovation programme
under the Marie Skłodowska-Curie grant agreement No. 754411. The Austrian science
fund (FWF) M-3073."
article_processing_charge: No
author:
- first_name: André
full_name: Lieutier, André
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: 'Lieutier A, Wintraecken M. Hausdorff and Gromov-Hausdorff stable subsets of
the medial axis. In: Proceedings of the 55th Annual ACM Symposium on Theory
of Computing. Association for Computing Machinery; 2023:1768-1776. doi:10.1145/3564246.3585113'
apa: 'Lieutier, A., & Wintraecken, M. (2023). Hausdorff and Gromov-Hausdorff
stable subsets of the medial axis. In Proceedings of the 55th Annual ACM Symposium
on Theory of Computing (pp. 1768–1776). Orlando, FL, United States: Association
for Computing Machinery. https://doi.org/10.1145/3564246.3585113'
chicago: Lieutier, André, and Mathijs Wintraecken. “Hausdorff and Gromov-Hausdorff
Stable Subsets of the Medial Axis.” In Proceedings of the 55th Annual ACM Symposium
on Theory of Computing, 1768–76. Association for Computing Machinery, 2023.
https://doi.org/10.1145/3564246.3585113.
ieee: A. Lieutier and M. Wintraecken, “Hausdorff and Gromov-Hausdorff stable subsets
of the medial axis,” in Proceedings of the 55th Annual ACM Symposium on Theory
of Computing, Orlando, FL, United States, 2023, pp. 1768–1776.
ista: 'Lieutier A, Wintraecken M. 2023. Hausdorff and Gromov-Hausdorff stable subsets
of the medial axis. Proceedings of the 55th Annual ACM Symposium on Theory of
Computing. STOC: Symposium on Theory of Computing, 1768–1776.'
mla: Lieutier, André, and Mathijs Wintraecken. “Hausdorff and Gromov-Hausdorff Stable
Subsets of the Medial Axis.” Proceedings of the 55th Annual ACM Symposium on
Theory of Computing, Association for Computing Machinery, 2023, pp. 1768–76,
doi:10.1145/3564246.3585113.
short: A. Lieutier, M. Wintraecken, in:, Proceedings of the 55th Annual ACM Symposium
on Theory of Computing, Association for Computing Machinery, 2023, pp. 1768–1776.
conference:
end_date: 2023-06-23
location: Orlando, FL, United States
name: 'STOC: Symposium on Theory of Computing'
start_date: 2023-06-20
date_created: 2023-05-22T08:02:02Z
date_published: 2023-06-02T00:00:00Z
date_updated: 2023-05-22T08:15:19Z
day: '02'
department:
- _id: HeEd
doi: 10.1145/3564246.3585113
ec_funded: 1
external_id:
arxiv:
- '2303.04014'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/2303.04014
month: '06'
oa: 1
oa_version: Preprint
page: 1768-1776
project:
- _id: 260C2330-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '754411'
name: ISTplus - Postdoctoral Fellowships
- _id: fc390959-9c52-11eb-aca3-afa58bd282b2
grant_number: M03073
name: Learning and triangulating manifolds via collapses
publication: Proceedings of the 55th Annual ACM Symposium on Theory of Computing
publication_identifier:
isbn:
- '9781450399135'
publication_status: published
publisher: Association for Computing Machinery
quality_controlled: '1'
status: public
title: Hausdorff and Gromov-Hausdorff stable subsets of the medial axis
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2023'
...
---
_id: '12086'
abstract:
- lang: eng
text: We present a simple algorithm for computing higher-order Delaunay mosaics
that works in Euclidean spaces of any finite dimensions. The algorithm selects
the vertices of the order-k mosaic from incrementally constructed lower-order
mosaics and uses an algorithm for weighted first-order Delaunay mosaics as a black-box
to construct the order-k mosaic from its vertices. Beyond this black-box, the
algorithm uses only combinatorial operations, thus facilitating easy implementation.
We extend this algorithm to compute higher-order α-shapes and provide open-source
implementations. We present experimental results for properties of higher-order
Delaunay mosaics of random point sets.
acknowledgement: Open access funding provided by Austrian Science Fund (FWF). This
project has received funding from the European Research Council (ERC) under the
European Union’s Horizon 2020 research and innovation programme, Grant No. 788183,
from the Wittgenstein Prize, Austrian Science Fund (FWF), Grant No. Z 342-N31, and
from the DFG Collaborative Research Center TRR 109, ‘Discretization in Geometry
and Dynamics’, Austrian Science Fund (FWF), Grant No. I 02979-N35.
article_processing_charge: Yes (via OA deal)
article_type: original
author:
- first_name: Herbert
full_name: Edelsbrunner, Herbert
id: 3FB178DA-F248-11E8-B48F-1D18A9856A87
last_name: Edelsbrunner
orcid: 0000-0002-9823-6833
- first_name: Georg F
full_name: Osang, Georg F
id: 464B40D6-F248-11E8-B48F-1D18A9856A87
last_name: Osang
citation:
ama: Edelsbrunner H, Osang GF. A simple algorithm for higher-order Delaunay mosaics
and alpha shapes. Algorithmica. 2023;85:277-295. doi:10.1007/s00453-022-01027-6
apa: Edelsbrunner, H., & Osang, G. F. (2023). A simple algorithm for higher-order
Delaunay mosaics and alpha shapes. Algorithmica. Springer Nature. https://doi.org/10.1007/s00453-022-01027-6
chicago: Edelsbrunner, Herbert, and Georg F Osang. “A Simple Algorithm for Higher-Order
Delaunay Mosaics and Alpha Shapes.” Algorithmica. Springer Nature, 2023.
https://doi.org/10.1007/s00453-022-01027-6.
ieee: H. Edelsbrunner and G. F. Osang, “A simple algorithm for higher-order Delaunay
mosaics and alpha shapes,” Algorithmica, vol. 85. Springer Nature, pp.
277–295, 2023.
ista: Edelsbrunner H, Osang GF. 2023. A simple algorithm for higher-order Delaunay
mosaics and alpha shapes. Algorithmica. 85, 277–295.
mla: Edelsbrunner, Herbert, and Georg F. Osang. “A Simple Algorithm for Higher-Order
Delaunay Mosaics and Alpha Shapes.” Algorithmica, vol. 85, Springer Nature,
2023, pp. 277–95, doi:10.1007/s00453-022-01027-6.
short: H. Edelsbrunner, G.F. Osang, Algorithmica 85 (2023) 277–295.
date_created: 2022-09-11T22:01:57Z
date_published: 2023-01-01T00:00:00Z
date_updated: 2023-06-27T12:53:43Z
day: '01'
ddc:
- '510'
department:
- _id: HeEd
doi: 10.1007/s00453-022-01027-6
ec_funded: 1
external_id:
isi:
- '000846967100001'
file:
- access_level: open_access
checksum: 71685ca5121f4c837f40c3f8eb50c915
content_type: application/pdf
creator: dernst
date_created: 2023-01-20T10:02:48Z
date_updated: 2023-01-20T10:02:48Z
file_id: '12322'
file_name: 2023_Algorithmica_Edelsbrunner.pdf
file_size: 911017
relation: main_file
success: 1
file_date_updated: 2023-01-20T10:02:48Z
has_accepted_license: '1'
intvolume: ' 85'
isi: 1
language:
- iso: eng
month: '01'
oa: 1
oa_version: Published Version
page: 277-295
project:
- _id: 266A2E9E-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '788183'
name: Alpha Shape Theory Extended
- _id: 268116B8-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: Z00342
name: The Wittgenstein Prize
- _id: 2561EBF4-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: I02979-N35
name: Persistence and stability of geometric complexes
publication: Algorithmica
publication_identifier:
eissn:
- 1432-0541
issn:
- 0178-4617
publication_status: published
publisher: Springer Nature
quality_controlled: '1'
scopus_import: '1'
status: public
title: A simple algorithm for higher-order Delaunay mosaics and alpha shapes
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: 2EBD1598-F248-11E8-B48F-1D18A9856A87
volume: 85
year: '2023'
...
---
_id: '12287'
abstract:
- lang: eng
text: We present criteria for establishing a triangulation of a manifold. Given
a manifold M, a simplicial complex A, and a map H from the underlying space of
A to M, our criteria are presented in local coordinate charts for M, and ensure
that H is a homeomorphism. These criteria do not require a differentiable structure,
or even an explicit metric on M. No Delaunay property of A is assumed. The result
provides a triangulation guarantee for algorithms that construct a simplicial
complex by working in local coordinate patches. Because the criteria are easily
verified in such a setting, they are expected to be of general use.
acknowledgement: "This 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). Arijit Ghosh is supported by Ramanujan
Fellowship (No. SB/S2/RJN-064/2015). Part of this work was done when Arijit Ghosh
was a Researcher at Max-Planck-Institute for Informatics, Germany, supported by
the IndoGerman Max Planck Center for Computer Science (IMPECS). Mathijs Wintraecken
also received funding from the European Union’s Horizon 2020 research and innovation
programme under the Marie Skłodowska-Curie grant agreement No. 754411 and the Austrian
Science Fund (FWF): M-3073. A part of the results described in this paper were presented
at SoCG 2018 and in [3]. \r\nOpen access funding provided by the Austrian Science
Fund (FWF)."
article_processing_charge: No
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: 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, Wintraecken M. Local criteria for triangulating
general manifolds. Discrete & Computational Geometry. 2023;69:156-191.
doi:10.1007/s00454-022-00431-7
apa: Boissonnat, J.-D., Dyer, R., Ghosh, A., & Wintraecken, M. (2023). Local
criteria for triangulating general manifolds. Discrete & Computational
Geometry. Springer Nature. https://doi.org/10.1007/s00454-022-00431-7
chicago: Boissonnat, Jean-Daniel, Ramsay Dyer, Arijit Ghosh, and Mathijs Wintraecken.
“Local Criteria for Triangulating General Manifolds.” Discrete & Computational
Geometry. Springer Nature, 2023. https://doi.org/10.1007/s00454-022-00431-7.
ieee: J.-D. Boissonnat, R. Dyer, A. Ghosh, and M. Wintraecken, “Local criteria for
triangulating general manifolds,” Discrete & Computational Geometry,
vol. 69. Springer Nature, pp. 156–191, 2023.
ista: Boissonnat J-D, Dyer R, Ghosh A, Wintraecken M. 2023. Local criteria for triangulating
general manifolds. Discrete & Computational Geometry. 69, 156–191.
mla: Boissonnat, Jean-Daniel, et al. “Local Criteria for Triangulating General Manifolds.”
Discrete & Computational Geometry, vol. 69, Springer Nature, 2023,
pp. 156–91, doi:10.1007/s00454-022-00431-7.
short: J.-D. Boissonnat, R. Dyer, A. Ghosh, M. Wintraecken, Discrete & Computational
Geometry 69 (2023) 156–191.
date_created: 2023-01-16T10:04:06Z
date_published: 2023-01-01T00:00:00Z
date_updated: 2023-08-01T12:47:32Z
day: '01'
ddc:
- '510'
department:
- _id: HeEd
doi: 10.1007/s00454-022-00431-7
ec_funded: 1
external_id:
isi:
- '000862193600001'
file:
- access_level: open_access
checksum: 46352e0ee71e460848f88685ca852681
content_type: application/pdf
creator: dernst
date_created: 2023-02-02T11:01:10Z
date_updated: 2023-02-02T11:01:10Z
file_id: '12488'
file_name: 2023_DiscreteCompGeometry_Boissonnat.pdf
file_size: 582850
relation: main_file
success: 1
file_date_updated: 2023-02-02T11:01:10Z
has_accepted_license: '1'
intvolume: ' 69'
isi: 1
keyword:
- Computational Theory and Mathematics
- Discrete Mathematics and Combinatorics
- Geometry and Topology
- Theoretical Computer Science
language:
- iso: eng
month: '01'
oa: 1
oa_version: Published Version
page: 156-191
project:
- _id: 260C2330-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '754411'
name: ISTplus - Postdoctoral Fellowships
- _id: fc390959-9c52-11eb-aca3-afa58bd282b2
grant_number: M03073
name: Learning and triangulating manifolds via collapses
publication: Discrete & 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 criteria for triangulating general manifolds
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: 4359f0d1-fa6c-11eb-b949-802e58b17ae8
volume: 69
year: '2023'
...
---
_id: '12548'
abstract:
- lang: eng
text: The limited exchange between human communities is a key factor in preventing
the spread of COVID-19. This paper introduces a digital framework that combines
an integration of real mobility data at the country scale with a series of modeling
techniques and visual capabilities that highlight mobility patterns before and
during the pandemic. The findings not only significantly exhibit mobility trends
and different degrees of similarities at regional and local levels but also provide
potential insight into the emergence of a pandemic on human behavior patterns
and their likely socio-economic impacts.
article_number: '00093'
article_processing_charge: No
author:
- first_name: Mohammad
full_name: Forghani, Mohammad
last_name: Forghani
- first_name: Christophe
full_name: Claramunt, Christophe
last_name: Claramunt
- first_name: Farid
full_name: Karimipour, Farid
id: 2A2BCDC4-CF62-11E9-BE5E-3B1EE6697425
last_name: Karimipour
orcid: 0000-0001-6746-4174
- first_name: Georg
full_name: Heiler, Georg
last_name: Heiler
citation:
ama: 'Forghani M, Claramunt C, Karimipour F, Heiler G. Visual analytics of mobility
network changes observed using mobile phone data during COVID-19 pandemic. In:
2022 IEEE International Conference on Data Mining Workshops. Institute
of Electrical and Electronics Engineers; 2023. doi:10.1109/icdmw58026.2022.00093'
apa: 'Forghani, M., Claramunt, C., Karimipour, F., & Heiler, G. (2023). Visual
analytics of mobility network changes observed using mobile phone data during
COVID-19 pandemic. In 2022 IEEE International Conference on Data Mining Workshops.
Orlando, FL, United States: Institute of Electrical and Electronics Engineers.
https://doi.org/10.1109/icdmw58026.2022.00093'
chicago: Forghani, Mohammad, Christophe Claramunt, Farid Karimipour, and Georg Heiler.
“Visual Analytics of Mobility Network Changes Observed Using Mobile Phone Data
during COVID-19 Pandemic.” In 2022 IEEE International Conference on Data Mining
Workshops. Institute of Electrical and Electronics Engineers, 2023. https://doi.org/10.1109/icdmw58026.2022.00093.
ieee: M. Forghani, C. Claramunt, F. Karimipour, and G. Heiler, “Visual analytics
of mobility network changes observed using mobile phone data during COVID-19 pandemic,”
in 2022 IEEE International Conference on Data Mining Workshops, Orlando,
FL, United States, 2023.
ista: 'Forghani M, Claramunt C, Karimipour F, Heiler G. 2023. Visual analytics of
mobility network changes observed using mobile phone data during COVID-19 pandemic.
2022 IEEE International Conference on Data Mining Workshops. ICDMW: Conference
on Data Mining Workshops, 00093.'
mla: Forghani, Mohammad, et al. “Visual Analytics of Mobility Network Changes Observed
Using Mobile Phone Data during COVID-19 Pandemic.” 2022 IEEE International
Conference on Data Mining Workshops, 00093, Institute of Electrical and Electronics
Engineers, 2023, doi:10.1109/icdmw58026.2022.00093.
short: M. Forghani, C. Claramunt, F. Karimipour, G. Heiler, in:, 2022 IEEE International
Conference on Data Mining Workshops, Institute of Electrical and Electronics Engineers,
2023.
conference:
end_date: 2022-12-01
location: Orlando, FL, United States
name: 'ICDMW: Conference on Data Mining Workshops'
start_date: 2022-11-28
date_created: 2023-02-14T07:56:21Z
date_published: 2023-02-08T00:00:00Z
date_updated: 2023-08-01T13:15:48Z
day: '08'
ddc:
- '600'
department:
- _id: HeEd
doi: 10.1109/icdmw58026.2022.00093
external_id:
isi:
- '000971492200145'
file:
- access_level: open_access
checksum: c253bee25e6dfe484f96662daa119cb6
content_type: application/pdf
creator: fkarimip
date_created: 2023-02-14T07:58:26Z
date_updated: 2023-02-14T07:58:26Z
file_id: '12549'
file_name: Visual Analysis_Mobility_COVID19 - SocDM2022.pdf
file_size: 1183339
relation: main_file
success: 1
file_date_updated: 2023-02-14T07:58:26Z
has_accepted_license: '1'
isi: 1
language:
- iso: eng
month: '02'
oa: 1
oa_version: Submitted Version
publication: 2022 IEEE International Conference on Data Mining Workshops
publication_identifier:
eisbn:
- '9798350346091'
eissn:
- 2375-9259
publication_status: published
publisher: Institute of Electrical and Electronics Engineers
quality_controlled: '1'
status: public
title: Visual analytics of mobility network changes observed using mobile phone data
during COVID-19 pandemic
type: conference
user_id: 4359f0d1-fa6c-11eb-b949-802e58b17ae8
year: '2023'
...
---
_id: '12544'
abstract:
- lang: eng
text: Geometry is crucial in our efforts to comprehend the structures and dynamics
of biomolecules. For example, volume, surface area, and integrated mean and Gaussian
curvature of the union of balls representing a molecule are used to quantify its
interactions with the water surrounding it in the morphometric implicit solvent
models. The Alpha Shape theory provides an accurate and reliable method for computing
these geometric measures. In this paper, we derive homogeneous formulas for the
expressions of these measures and their derivatives with respect to the atomic
coordinates, and we provide algorithms that implement them into a new software
package, AlphaMol. The only variables in these formulas are the interatomic distances,
making them insensitive to translations and rotations. AlphaMol includes a sequential
algorithm and a parallel algorithm. In the parallel version, we partition the
atoms of the molecule of interest into 3D rectangular blocks, using a kd-tree
algorithm. We then apply the sequential algorithm of AlphaMol to each block, augmented
by a buffer zone to account for atoms whose ball representations may partially
cover the block. The current parallel version of AlphaMol leads to a 20-fold speed-up
compared to an independent serial implementation when using 32 processors. For
instance, it takes 31 s to compute the geometric measures and derivatives of each
atom in a viral capsid with more than 26 million atoms on 32 Intel processors
running at 2.7 GHz. The presence of the buffer zones, however, leads to redundant
computations, which ultimately limit the impact of using multiple processors.
AlphaMol is available as an OpenSource software.
acknowledgement: "P.K. acknowledges support from the University of California Multicampus
Research Programs and Initiatives (Grant No. M21PR3267) and from the NSF (Grant
No.1760485). H.E. acknowledges support from the European Research Council (ERC)
under the European Union’s Horizon 2020 research and innovation program, Grant No.
788183, from the Wittgenstein Prize, Austrian Science Fund (FWF), Grant No. Z 342-N31,
and from the DFG Collaborative Research Center TRR 109, ‘Discretization in Geometry
and Dynamics’, Austrian Science Fund (FWF), Grant No. I 02979-N35.\r\nOpen Access
is funded by the Austrian Science Fund (FWF)."
article_processing_charge: No
article_type: original
author:
- first_name: Patrice
full_name: Koehl, Patrice
last_name: Koehl
- first_name: Arseniy
full_name: Akopyan, Arseniy
id: 430D2C90-F248-11E8-B48F-1D18A9856A87
last_name: Akopyan
orcid: 0000-0002-2548-617X
- first_name: Herbert
full_name: Edelsbrunner, Herbert
id: 3FB178DA-F248-11E8-B48F-1D18A9856A87
last_name: Edelsbrunner
orcid: 0000-0002-9823-6833
citation:
ama: Koehl P, Akopyan A, Edelsbrunner H. Computing the volume, surface area, mean,
and Gaussian curvatures of molecules and their derivatives. Journal of Chemical
Information and Modeling. 2023;63(3):973-985. doi:10.1021/acs.jcim.2c01346
apa: Koehl, P., Akopyan, A., & Edelsbrunner, H. (2023). Computing the volume,
surface area, mean, and Gaussian curvatures of molecules and their derivatives.
Journal of Chemical Information and Modeling. American Chemical Society.
https://doi.org/10.1021/acs.jcim.2c01346
chicago: Koehl, Patrice, Arseniy Akopyan, and Herbert Edelsbrunner. “Computing the
Volume, Surface Area, Mean, and Gaussian Curvatures of Molecules and Their Derivatives.”
Journal of Chemical Information and Modeling. American Chemical Society,
2023. https://doi.org/10.1021/acs.jcim.2c01346.
ieee: P. Koehl, A. Akopyan, and H. Edelsbrunner, “Computing the volume, surface
area, mean, and Gaussian curvatures of molecules and their derivatives,” Journal
of Chemical Information and Modeling, vol. 63, no. 3. American Chemical Society,
pp. 973–985, 2023.
ista: Koehl P, Akopyan A, Edelsbrunner H. 2023. Computing the volume, surface area,
mean, and Gaussian curvatures of molecules and their derivatives. Journal of Chemical
Information and Modeling. 63(3), 973–985.
mla: Koehl, Patrice, et al. “Computing the Volume, Surface Area, Mean, and Gaussian
Curvatures of Molecules and Their Derivatives.” Journal of Chemical Information
and Modeling, vol. 63, no. 3, American Chemical Society, 2023, pp. 973–85,
doi:10.1021/acs.jcim.2c01346.
short: P. Koehl, A. Akopyan, H. Edelsbrunner, Journal of Chemical Information and
Modeling 63 (2023) 973–985.
date_created: 2023-02-12T23:00:59Z
date_published: 2023-02-13T00:00:00Z
date_updated: 2023-08-16T12:22:07Z
day: '13'
ddc:
- '510'
- '540'
department:
- _id: HeEd
doi: 10.1021/acs.jcim.2c01346
ec_funded: 1
external_id:
isi:
- '000920370700001'
pmid:
- '36638318'
file:
- access_level: open_access
checksum: 7d20562269edff1e31b9d6019d4983b0
content_type: application/pdf
creator: dernst
date_created: 2023-08-16T12:21:13Z
date_updated: 2023-08-16T12:21:13Z
file_id: '14070'
file_name: 2023_JCIM_Koehl.pdf
file_size: 8069223
relation: main_file
success: 1
file_date_updated: 2023-08-16T12:21:13Z
has_accepted_license: '1'
intvolume: ' 63'
isi: 1
issue: '3'
language:
- iso: eng
month: '02'
oa: 1
oa_version: Published Version
page: 973-985
pmid: 1
project:
- _id: 266A2E9E-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '788183'
name: Alpha Shape Theory Extended
- _id: 268116B8-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: Z00342
name: The Wittgenstein Prize
- _id: 2561EBF4-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: I02979-N35
name: Persistence and stability of geometric complexes
publication: Journal of Chemical Information and Modeling
publication_identifier:
eissn:
- 1549-960X
issn:
- 1549-9596
publication_status: published
publisher: American Chemical Society
quality_controlled: '1'
scopus_import: '1'
status: public
title: Computing the volume, surface area, mean, and Gaussian curvatures of molecules
and their derivatives
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: 63
year: '2023'
...