Остановите войну!
for scientists:
default search action
Mark de Berg
- > Home > Persons > Mark de Berg
Publications
- 2023
- [j128]Mark de Berg:
A Note on Reachability and Distance Oracles for Transmission Graphs. Comput. Geom. Topol. 2(1): 4:1-4:15 (2023) - 2022
- [i40]Mark de Berg:
A Note on Reachability and Distance Oracles for Transmission Graphs. CoRR abs/2210.05788 (2022) - 2021
- [j123]Mark de Berg:
Removing Depth-Order Cycles Among Triangles: An Algorithm Generating Triangular Fragments. Discret. Comput. Geom. 65(2): 450-469 (2021) - 2019
- [c131]Mark de Berg:
ETH-Tight Algorithms for Geometric Network Problems Using Geometric Separators. CCCG 2019: 225 - 2017
- [c122]Mark de Berg:
Removing Depth-Order Cycles among Triangles: An Efficient Algorithm Generating Triangular Fragments. FOCS 2017: 272-282 - [i26]Mark de Berg:
Removing Depth-Order Cycles Among Triangles: An Efficient Algorithm Generating Triangular Fragments. CoRR abs/1701.00679 (2017) - 2016
- [r2]Mark de Berg:
Hierarchical Space Decompositions for Low-Density Scenes. Encyclopedia of Algorithms 2016: 909-914 - 2012
- [j89]Mark de Berg:
Guest Editorial. Algorithmica 63(4): 731-732 (2012) - 2010
- [c86]Mark de Berg:
Better bounds on the union complexity of locally fat objects. SCG 2010: 39-47 - 2008
- [j63]Mark de Berg:
Improved Bounds on the Union Complexity of Fat Objects. Discret. Comput. Geom. 40(1): 127-140 (2008) - 2005
- [c56]Mark de Berg:
Vertical ray shooting for fat objects. SCG 2005: 288-295 - [c54]Mark de Berg:
Improved Bounds on the Union Complexity of Fat Objects. FSTTCS 2005: 116-127 - 2004
- [j50]Mark de Berg:
Guest Editor's Foreword. Discret. Comput. Geom. 32(2): 165-166 (2004) - 2003
- [c47]Mark de Berg:
Kinetic Dictionaries: How to Shoot a Moving Target. ESA 2003: 172-183 - 2000
- [b4]Mark de Berg:
Computational geometry: algorithms and applications, 2nd Edition. Springer 2000, ISBN 3540656200, pp. I-XII, 1-367 - [j37]Mark de Berg:
Linear Size Binary Space Partitions for Uncluttered Scenes. Algorithmica 28(3): 353-366 (2000) - 1997
- [b3]Mark de Berg:
Computational geometry: algorithms and applications. Springer 1997, ISBN 354061270X, pp. I-XII, 1-365 - [j26]Mark de Berg:
Trends and Developments in Computational Geometry. Comput. Graph. Forum 16(1): 3-30 (1997) - 1996
- [j20]Mark de Berg:
Computing Half-plane and Strip Discrepancy of Planar Point Sets. Comput. Geom. 6: 69-83 (1996) - [p1]Mark de Berg:
Visualization of TINs. Algorithmic Foundations of Geographic Information Systems 1996: 79-97 - 1995
- [j17]Mark de Berg:
Generalized Hidden Surface Removal. Comput. Geom. 5: 249-276 (1995) - [c20]Mark de Berg:
Linear Size Binary Space Partitions for Fat Objects. ESA 1995: 252-263 - 1993
- [b2]Mark de Berg:
Ray Shooting, Depth Orders and Hidden Surface Removal. Lecture Notes in Computer Science 703, Springer 1993, ISBN 3-540-57020-9 - [c13]Mark de Berg:
Generalized Hidden Surface Removal. SCG 1993: 1-10 - 1992
- [b1]Mark de Berg:
Efficient algorithms for ray shooting and hidden surface removal. Universität Utrecht, 1992, pp. I-VIII, 1-225 - [j7]Mark de Berg:
Dynamic Output-sensitive Hidden Surface Removal for C-oriented Polyhedra. Comput. Geom. 2: 119-140 (1992) - 1991
- [j3]Mark de Berg:
On Rectilinear Link Distance. Comput. Geom. 1: 13-34 (1991) - 1990
- [c4]Mark de Berg:
Translating Polygons with Applications to Hidden Surface Removal. SWAT 1990: 60-70
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from , , and to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-21 17:31 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint