CV Lattes
ResearcherID
ORCID
Google Scholar Citations
Universidade Estadual de Campinas (UNICAMP). Instituto de Computação (IC) (Institutional affiliation from the last research proposal) Birthplace: Brazil
Bachelor in Mathematics from Universidade de Brasília (1977), Master in Mathematics from Universidade de Brasília (1979) and Ph.D. in Computer Science from Northwestern University (1988), Livre-Docente from Universidade Estadual de Campinas (1996) and Pos-doctorate at McGill University, Canadá, (2006-07). Presently, he is Associate Professor (MS-5.3) at UNICAMP. He has experience working in Computer Science, with emphasis in Computational Geometry, conducting research on geometric algorithms, optimization of NP-hard geometric problems, visualization environments, oriented projective geometry, algorithm animation, image processing, pattern recognition and active learning. (Source: Lattes Curriculum)
| News published in Agência FAPESP Newsletter about the researcher |
| More itemsLess items |
| TITULO |
| Articles published in other media outlets ( ): |
| More itemsLess items |
| VEICULO: TITULO (DATA) |
| VEICULO: TITULO (DATA) |
The goal of this proposal is to investigate solutions to several difficult combinatorial problems with the intent of obtaining both heuristics and exact methods that are, in practice, efficient for solving large instances. The problems considered are related to the area of computational geometry and most of them present geometric characteristics that, if properly exploited, will benefit t…
We present a research proposal to be developed during the Master's Program in Computer Science at the Institute of Computing of the University of Campinas. The research topic involves the study of an NP-hard combinatorial optimization problem called perfect awareness. In this problem, we consider a social network in which information is propagated between connected individuals. The goal i…
In this project, we study integer linear programing formulations and heuristics for geometric decomposition problems. In this context, geometric decomposition problems have the goal of covering, packing or partitioning a given region in the plane with objects of predetermined shapes in order to optimize a given objective function. One of the most studied geometric decomposition problems i…
This research project aims to study the problem of determining the inversion distance between triangulations. Given two triangles that share an edge in a triangulation and whose union forms a convex quadrilateral, an edge-inversion is the replacement of the edge shared by them by the other diagonal of the quadrilateral they form. Given two triangulation T1 and T2 of a set of points, it is…
(Only some records are available in English at this moment)
The recently proposed Chromatic Art Gallery Problem (CAGP) has had some theoretical results presented in the literature but no studies concerning exact algorithms have been done, so far. The CAGP is related to the well known Art Gallery Problem (AGP). Contrary to the original AGP, in this variant, we are interested in minimizing the number of colors used in a valid coloring of a set of gu…
| 5 / 3 | Completed research grants |
| 11 / 4 | Completed scholarships in Brazil |
| 2 / 1 | Completed scholarships abroad |
| 18 / 8 | All research grants and scholarships |
| Associated processes | |