default search action
Gert Vegter
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
- [j20]Matthijs Ebbens
, Hugo Parlier
Minimal Delaunay Triangulations of Hyperbolic Surfaces. Discret. Comput. Geom. 69(2): 568-592 (2023) - 2022
- [j19]Matthijs Ebbens, Iordan Iordanov, Monique Teillaud, Gert Vegter:
Delaunay triangulations of generalized Bolza surfaces. J. Comput. Geom. 13(1): 125-177 (2022) - 2021
- [c25]Matthijs Ebbens
Minimal Delaunay Triangulations of Hyperbolic Surfaces. SoCG 2021: 31:1-31:16 - [i6]Matthijs Ebbens, Iordan Iordanov, Monique Teillaud, Gert Vegter:
Delaunay triangulations of generalized Bolza surfaces. CoRR abs/2103.05960 (2021) - 2020
- [i5]Jyh-Ming Lien, Vikram Sharma, Gert Vegter, Chee Yap:
Isotopic Arrangement of Simple Curves: an Exact Numerical Approach based on Subdivision. CoRR abs/2009.00811 (2020) - [i4]Matthijs Ebbens, Hugo Parlier, Gert Vegter:
Minimal Delaunay triangulations of hyperbolic surfaces. CoRR abs/2011.09847 (2020)
2010 – 2019
- 2019
- [j18]Ramsay Dyer, Gert Vegter, Mathijs Hubertus Maria Johannes Wintraecken
Simplices modelled on spaces of constant curvature. J. Comput. Geom. 10(1): 223-256 (2019) - [c24]Mathijs Wintraecken, Gert Vegter:
The extrinsic nature of the Hausdor distance of optimal triangulations of manifolds. CCCG 2019: 275-279 - 2017
- [j17]Amit Chattopadhyay
Certified computation of planar Morse-Smale complexes. J. Symb. Comput. 78: 3-40 (2017) - 2016
- [c23]Mikhail Bogdanov, Monique Teillaud, Gert Vegter:
Delaunay Triangulations on Orientable Surfaces of Low Genus. SoCG 2016: 20:1-20:17 - [i3]Ramsay Dyer, Gert Vegter, Mathijs Wintraecken
Barycentric coordinate neighbourhoods in Riemannian manifolds. CoRR abs/1606.01585 (2016) - 2015
- [j16]Mathijs H. M. J. Wintraecken
On the Optimal Triangulation of Convex Hypersurfaces, Whose Vertices Lie in Ambient Space. Math. Comput. Sci. 9(3): 345-353 (2015) - [c22]Ramsay Dyer, Gert Vegter, Mathijs Wintraecken
Riemannian Simplices and Triangulations. SoCG 2015: 255-269 - [i2]Amit Chattopadhyay, Gert Vegter, Chee-Keng Yap:
Certified Computation of planar Morse-Smale Complexes. CoRR abs/1506.06265 (2015) - 2014
- [c21]Jyh-Ming Lien, Vikram Sharma, Gert Vegter, Chee Yap:
Isotopic Arrangement of Simple Curves: An Exact Numerical Approach Based on Subdivision. ICMS 2014: 277-282 - [i1]Ramsay Dyer, Gert Vegter, Mathijs Wintraecken:
Riemannian simplices and triangulations. CoRR abs/1406.3740 (2014) - 2012
- [j15]Amit Chattopadhyay
Certified meshing of Radial Basis Function based isosurfaces. Vis. Comput. 28(5): 445-462 (2012) - [c20]Gert Vegter, Amit Chattopadhyay
Certified computation of planar morse-smale complexes. SCG 2012: 259-268 - [c19]Johan Hidding, Rien van de Weygaert, Gert Vegter, Bernard J. T. Jones, Monique Teillaud:
The sticky geometry of the cosmic web. SCG 2012: 421-422 - 2011
- [j14]Rien van de Weygaert, Gert Vegter, Herbert Edelsbrunner, Bernard J. T. Jones, Pratyush Pranav
Alpha, Betti and the Megaparsec Universe: On the Topology of the Cosmic Web. Trans. Comput. Sci. 14: 60-101 (2011) - 2010
- [j13]Gert Vegter, Chee-Keng Yap:
Foreword. Math. Comput. Sci. 4(4): 385-387 (2010) - [c18]Rien van de Weygaert, Erwin Platen
Alpha Shape Topology of the Cosmic Web. ISVD 2010: 224-234
2000 – 2009
- 2009
- [j12]Oswin Aichholzer
Recovering Structure from r-Sampled Objects. Comput. Graph. Forum 28(5): 1349-1360 (2009) - 2008
- [j11]Jean-Daniel Boissonnat, David Cohen-Steiner, Gert Vegter:
Isotopic Implicit Surface Meshing. Discret. Comput. Geom. 39(1-3): 138-157 (2008) - 2007
- [j10]Nico Kruithof, Gert Vegter:
Meshing skin surfaces with certified topology. Comput. Geom. 36(3): 166-182 (2007) - [j9]Sunayana Ghosh, Sylvain Petitjean, Gert Vegter:
Approximation by Conic Splines. Math. Comput. Sci. 1(1): 39-69 (2007) - [j8]Simon Plantinga, Gert Vegter:
Isotopic meshing of implicit surfaces. Vis. Comput. 23(1): 45-58 (2007) - [c17]Simon Plantinga, Gert Vegter:
Certified meshing of families of isosurfaces. Shape Modeling International 2007: 261-270 - 2006
- [j7]Simon Plantinga, Gert Vegter:
Computing contour generators of evolving implicit surfaces. ACM Trans. Graph. 25(4): 1243-1280 (2006) - [c16]Nico Kruithof, Gert Vegter:
Envelope surfaces. SCG 2006: 411-420 - 2005
- [c15]Nico Kruithof, Gert Vegter:
Meshing skin surfaces with certified topology. CAD/Graphics 2005: 6 - 2004
- [j6]Nico Kruithof, Gert Vegter:
Approximation by skin surfaces. Comput. Aided Des. 36(11): 1075-1088 (2004) - [c14]Simon Plantinga, Gert Vegter:
Isotopic Approximation of Implicit Curves and Surfaces. Symposium on Geometry Processing 2004: 245-254 - [c13]Jean-Daniel Boissonnat, David Cohen-Steiner, Gert Vegter:
Isotopic implicit surface meshing. STOC 2004: 301-309 - [r1]Gert Vegter:
Computational Topology. Handbook of Discrete and Computational Geometry, 2nd Ed. 2004: 719-742 - 2003
- [j5]Éric Colin de Verdière, Michel Pocchiola, Gert Vegter:
Tutte's barycenter method applied to isotopies. Comput. Geom. 26(1): 81-97 (2003) - [c12]Simon Plantinga, Gert Vegter:
Contour generators of evolving implicit surfaces. Symposium on Solid Modeling and Applications 2003: 23-32 - [c11]Nico Kruithof, Gert Vegter:
Approximation by skin surfaces. Symposium on Solid Modeling and Applications 2003: 86-95 - 2001
- [c10]Éric Colin de Verdière, Michel Pocchiola, Gert Vegter:
Tutte's barycenter method applied to isotopies. CCCG 2001: 57-60 - [c9]Francis Lazarus, Michel Pocchiola, Gert Vegter, Anne Verroust
Computing a canonical polygonal schema of an orientable triangulated surface. SCG 2001: 80-89 - 2000
- [j4]Gert Vegter:
The apolar bilinear form in geometric modeling. Math. Comput. 69(230): 691-720 (2000)
1990 – 1999
- 1996
- [j3]Michel Pocchiola, Gert Vegter:
Minimal Tangent Visibility Graphs. Comput. Geom. 6: 303-314 (1996) - [j2]Michel Pocchiola, Gert Vegter:
Topologically Sweeping Visibility Complexes via Pseudotriangulations. Discret. Comput. Geom. 16(4): 419-453 (1996) - [j1]Michel Pocchiola, Gert Vegter:
The visibility complex. Int. J. Comput. Geom. Appl. 6(3): 279-308 (1996) - [c8]Michel Pocchiola, Gert Vegter:
Pseudo-Triangulations: Theory and Applications. SCG 1996: 291-300 - 1995
- [c7]Michel Pocchiola, Gert Vegter:
Computing the Visibility Graph via Pseudo-Triangulations. SCG 1995: 248-257 - 1994
- [c6]Michel Pocchiola, Gert Vegter:
Minimal Tangent Visibility Graphs. CCCG 1994: 24-29 - 1993
- [c5]Michel Pocchiola, Gert Vegter:
The Visibility Complex. SCG 1993: 328-337 - 1991
- [c4]Gert Vegter:
Dynamically Maintaining the Visibility Graph. WADS 1991: 425-436 - 1990
- [c3]Gert Vegter, Chee-Keng Yap:
Computational Complexity of Combinatorial Surfaces. SCG 1990: 102-111 - [c2]Gert Vegter:
The Visibility Diagram: a Data Structure for Visibility Problems and Motion Planning. SWAT 1990: 97-110
1980 – 1989
- 1989
- [c1]Gert Vegter:
Kink-Free Deformations of Polygons. SCG 1989: 61-68
Coauthor Index
aka: Mathijs H. M. J. Wintraecken
aka: Mathijs Hubertus Maria Johannes Wintraecken
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-08-05 20:20 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: