#### Filter Results:

- Full text PDF available (40)

#### Publication Year

1989

2018

- This year (1)
- Last 5 years (8)
- Last 10 years (21)

#### Publication Type

#### Co-author

#### Journals and Conferences

Learn More

- Michel Pocchiola, Gert Vegter
- Symposium on Computational Geometry
- 1993

We introduce the visibility complex of a collection<inline-equation><f><sc>O</sc></f></inline-equation> of <?Pub Fmt italic>n<?Pub Fmt /italic> pairwisedisjoint convex objects in the plane. This… (More)

- Michel Pocchiola, Gert Vegter
- Discrete & Computational Geometry
- 1996

This paper describes a new algorithm for constructing the set of free bitangents of a collection ofn disjoint convex obstacles of constant complexity. The algorithm runs in time O(n logn + k), wherek… (More)

- Gert Vegter, Chee-Keng Yap
- Symposium on Computational Geometry
- 1990

We investigate the computational problems associated with combinatorial surfaces. Specifically, we present an algorithm (based on the Brahana-Dehn-Heegaard approach) for transforming the polygonal… (More)

- Simon Plantinga, Gert Vegter
- Symposium on Geometry Processing
- 2004

Implicit surfaces are defined as the zero set of a function F: R3 ← R. Although several algorithms exist for generating piecewise linear approximations, most of them are based on a user-defined… (More)

- Francis Lazarus, Michel Pocchiola, Gert Vegter, Anne Verroust-Blondet
- Symposium on Computational Geometry
- 2001

A closed orientable surface of genus $g$ can be obtained by appropriat e identification of pairs of edges of a $4g$-gon (the polygonal schema). The identified edges form $2g$ loops on the surface,… (More)

- Rien van de Weygaert, Gert Vegter, +13 authors Monique Teillaud
- Trans. Computational Science
- 2011

We study the topology of the Megaparsec Cosmic Web in terms of the scale-dependent Betti numbers, which formalize the topological information content of the cosmic mass distribution. While the Betti… (More)

- Michel Pocchiola, Gert Vegter
- Symposium on Computational Geometry
- 1995

We show that the k free bitangents of a collection of n pairwise disjoint convex plane sets can be computed in time O(k + n log n) and O(n) working space. The algorithm uses only one advanced data… (More)

This paper addresses the problem of piecewise linear approximation of implicit surfaces. We first give a criterion ensuring that the zero-set of a smooth function and the one of a piecewise linear… (More)

- Nico Kruithof, Gert Vegter
- Ninth International Conference on Computer Aided…
- 2005

Skin surfaces are used for the modeling and visualization of molecules. They form a class of tangent continuous surfaces defined in terms of a set of balls (the atoms of the molecule) and a shrink… (More)

- AbstractMichel Pocchiola, Gert Vegter
- 1994

We introduce the notions of order type (or: dual arrangement) and visibility type (or: tangent visibility graph) for conngurations of disjoint convex sets in the plane. We develop optimal algorithms… (More)