Geovan Tavares
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Geovan Tavares has a total of 7 co-authors. Here are the top co-authors by number of shared publications:
- Hélio Lopes
Department of Informatics, Pontifical Catholic University of Rio de Janeiro (PUC-Rio), Rio de Janeiro, Brazil
4 shared publications - Thomas Lewiner
Department of Mathematics Pontifícia Universidade Católica Rio de Janeiro Brazil
3 shared publications - Alla Safonova
Computer Science Department, Carnegie Mellon University, USA
1 shared publication - Andrzej Szymczak
College of Computing, Georgia Tech, 85 5th street NW, Atlanta, GA 30332, USA
1 shared publication - Esdras Medeiros
Laboratório VISGRAF, IMPA, Rio de Janeiro, Brazil
1 shared publication - Jarek Rossignac
School of Interactive Computing, Georgia Institute of Technology, Atlanta, USA
1 shared publication
Latest Publications
- 1 January 2010
- Published by Elsevier in Computer Aided Geometric Design
- Vol. 27 (1) , 1-22
Topological mesh operators
- 1 January 2010
- Published by Elsevier in Computer Aided Geometric Design
- Vol. 27 (1) , 1-22
Topological mesh operators
- 31 August 2003
- Published by Elsevier in Computers & Graphics
- Vol. 27 (4) , 553-567
Edgebreaker: a simple implementation for surfaces with handles
- 31 August 2003
- Published by Elsevier in Computers & Graphics
- Vol. 27 (4) , 553-567
Edgebreaker: a simple implementation for surfaces with handles
- 1 January 2003
- Published by Taylor & Francis in Experimental Mathematics
- Vol. 12 (3) , 271-285
Toward Optimality in Discrete Morse Theory
Morse theory is a fundamental tool for investigating the topology of smooth manifolds. This tool has been extended to discrete structures by Forman, which allows combinatorial analysis and direct computation. This theory relies on discrete gradient vector fields, whose critical elements describe the topology of the structure. The purpose of this work is to construct optimal discrete gradient vector fields, where optimality means having the minimum number of critical elements. The problem is equivalently stated in terms of maximal hyperforests of hypergraphs. Deduced from this theoretical result, a algorithm constructing almost optimal discrete gradient fields is provided. The optimal parts of the algorithm are proved, and the part of exponential complexity is replaced by heuristics. Although reaching optimality is MAX-SNP hard, the experiments on odd topological models are almost always optimal.
- 1 January 2003
- Published by Taylor & Francis in Experimental Mathematics
- Vol. 12 (3) , 271-285
Toward Optimality in Discrete Morse Theory
Morse theory is a fundamental tool for investigating the topology of smooth manifolds. This tool has been extended to discrete structures by Forman, which allows combinatorial analysis and direct computation. This theory relies on discrete gradient vector fields, whose critical elements describe the topology of the structure. The purpose of this work is to construct optimal discrete gradient vector fields, where optimality means having the minimum number of critical elements. The problem is equivalently stated in terms of maximal hyperforests of hypergraphs. Deduced from this theoretical result, a algorithm constructing almost optimal discrete gradient fields is provided. The optimal parts of the algorithm are proved, and the part of exponential complexity is replaced by heuristics. Although reaching optimality is MAX-SNP hard, the experiments on odd topological models are almost always optimal.