Luiz Henrique de Figueiredo
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Luiz Henrique de Figueiredo has a total of 64 co-authors. Here are the top co-authors by number of shared publications:
Luiz Velho
8 shared publications- Afonso Paiva
ICMC-USP, São Carlos, São Paulo, Brazil
5 shared publications - João Batista Souza de Oliveira
Faculdade de Informática -Pontifícia Universidade Católica do Rio Grande do Sul (PUCRS ) Av. Ipiranga 6681 - Porto Alegre -RS
5 shared publications Waldemar Celes
Pontifical Catholic University of Rio de Janeiro, Brazil
5 shared publicationsEmilio Vital Brazil
4 shared publications- Hélio Lopes
Department of Informatics, Pontifical Catholic University of Rio de Janeiro (PUC-Rio), Rio de Janeiro, Brazil
4 shared publications
Latest Publications
- Open Access
- 17 January 2025
- Published by Sociedade Brasileira de Computação in Journal of the Brazilian Computer Society
- Vol. 31 (1) , 373-381
A concise representation for adaptive hexagonal meshes
Adaptive hexagonal meshes yield high-quality planar quadrilateral meshes, which are desirable in applications. We propose a concise exact representation for adaptive hexagonal meshes that is based solely on the faces. We represent each face by its position, type, orientation, and scale. Our representation is simple to use and requires a small fraction of the memory required by topological data structures. Although no other topological elements or relations are explicitly represented, the mesh and all its topological relations can be reconstructed in linear time.
- 17 January 2025
- Published by Sociedade Brasileira de Computação in Journal of the Brazilian Computer Society
- Vol. 31 (1) , 373-381
Open AccessA concise representation for adaptive hexagonal meshes
Adaptive hexagonal meshes yield high-quality planar quadrilateral meshes, which are desirable in applications. We propose a concise exact representation for adaptive hexagonal meshes that is based solely on the faces. We represent each face by its position, type, orientation, and scale. Our representation is simple to use and requires a small fraction of the memory required by topological data structures. Although no other topological elements or relations are explicitly represented, the mesh and all its topological relations can be reconstructed in linear time.
- 26 March 2024
- Published by Elsevier in Computers & Graphics
- Vol. 119
A vertex-centric representation for adaptive diamond-kite meshes
- 26 March 2024
- Published by Elsevier in Computers & Graphics
- Vol. 119
A vertex-centric representation for adaptive diamond-kite meshes
- 17 August 2022
- Published by Elsevier in Computers & Graphics
- Vol. 107, 252-263
Region reconstruction with the sphere-of-influence diagram
- 17 August 2022
- Published by Elsevier in Computers & Graphics
- Vol. 107, 252-263
Region reconstruction with the sphere-of-influence diagram
- 1 April 2021
- Published by Elsevier in Computers & Graphics
- Vol. 95, 69-80
An integer representation for periodic tilings of the plane by regular polygons
- 1 April 2021
- Published by Elsevier in Computers & Graphics
- Vol. 95, 69-80
An integer representation for periodic tilings of the plane by regular polygons
- 1 November 2020
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 31-38
Towards a Legion of Virtual Humans: Steering Behaviors and Organic Visualization
Many studies have been done to control virtual humans and crowds. Navigation, split, merge, and collision avoidance are examples of what has been done in such areas when simulating crowds of individuals. This paper explores the macroscopic crowds’ concept and seeks to solve two main issues: macroscopic crowd control and visualization. In particular, we are interested in providing steering behaviors applied to macroscopic models of crowds, in this case, called Legions of people, which are an abstraction for a vast amount of people. To provide the steering behaviors, we propose a multi-level control of such structures that can represent less or more people, in an emergent way. We also propose a new organic visualization of macroscopic and huge crowds based on blobby models.
- 1 November 2020
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 31-38
Towards a Legion of Virtual Humans: Steering Behaviors and Organic Visualization
Many studies have been done to control virtual humans and crowds. Navigation, split, merge, and collision avoidance are examples of what has been done in such areas when simulating crowds of individuals. This paper explores the macroscopic crowds’ concept and seeks to solve two main issues: macroscopic crowd control and visualization. In particular, we are interested in providing steering behaviors applied to macroscopic models of crowds, in this case, called Legions of people, which are an abstraction for a vast amount of people. To provide the steering behaviors, we propose a multi-level control of such structures that can represent less or more people, in an emergent way. We also propose a new organic visualization of macroscopic and huge crowds based on blobby models.
- 1 November 2020
- Published by Elsevier in Journal of Computational Physics
- Vol. 420
Simple and reliable boundary detection for meshfree particle methods using interval analysis
- 1 November 2020
- Published by Elsevier in Journal of Computational Physics
- Vol. 420
Simple and reliable boundary detection for meshfree particle methods using interval analysis
- 20 May 2019
- Published by Springer Nature in The Visual Computer
- Vol. 35 (6-8) , 899-907
Acquiring periodic tilings of regular polygons from images
- 20 May 2019
- Published by Springer Nature in The Visual Computer
- Vol. 35 (6-8) , 899-907
Acquiring periodic tilings of regular polygons from images
- Open Access
- 26 October 2018
- Published by Association for Computing Machinery (ACM) in Communications of the ACM
- Vol. 61 (11) , 114-123
A look at the design of Lua
Simplicity, small size, portability, and embeddability set Lua apart from other scripting languages.
- 26 October 2018
- Published by Association for Computing Machinery (ACM) in Communications of the ACM
- Vol. 61 (11) , 114-123
Open AccessA look at the design of Lua
Simplicity, small size, portability, and embeddability set Lua apart from other scripting languages.
- 1 October 2018
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 17-24
Synthesizing Periodic Tilings of Regular Polygons
We present a simple representation for periodic tilings of the plane by regular polygons. Our approach is to represent explicitly a minimal subset of the vertices from which we systematically generate all vertices in the tiling by translations. We then deduce the edges and the faces using the constraint that all edges have the same length. Our representation can be used to synthesize tilings manually and automatically from images.
- 1 October 2018
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 17-24
Synthesizing Periodic Tilings of Regular Polygons
We present a simple representation for periodic tilings of the plane by regular polygons. Our approach is to represent explicitly a minimal subset of the vertices from which we systematically generate all vertices in the tiling by translations. We then deduce the edges and the faces using the constraint that all edges have the same length. Our representation can be used to synthesize tilings manually and automatically from images.
- Open Access
- 1 January 2016
- Published by American Institute of Mathematical Sciences (AIMS) in Journal of Computational Dynamics
- Vol. 3 (2) , 113-137
Rigorous bounds for polynomial Julia sets
We present an algorithm for computing images of polynomial Julia sets that are reliable in the sense that they carry mathematical guarantees against sampling artifacts and rounding errors in floating-point arithmetic. We combine cell mapping based on interval arithmetic with label propagation in graphs to avoid function iteration and rounding errors. As a result, our algorithm avoids point sampling and can reliably classify entire rectangles in the complex plane as being on either side of the Julia set. The union of the rectangles that cannot be so classified is guaranteed to contain the Julia set. Our algorithm computes a refinable quadtree decomposition of the complex plane adapted to the Julia set which can be used for rendering and for approximating geometric properties such as the area of the filled Julia set and the fractal dimension of the Julia set.
- 1 January 2016
- Published by American Institute of Mathematical Sciences (AIMS) in Journal of Computational Dynamics
- Vol. 3 (2) , 113-137
Open AccessRigorous bounds for polynomial Julia sets
We present an algorithm for computing images of polynomial Julia sets that are reliable in the sense that they carry mathematical guarantees against sampling artifacts and rounding errors in floating-point arithmetic. We combine cell mapping based on interval arithmetic with label propagation in graphs to avoid function iteration and rounding errors. As a result, our algorithm avoids point sampling and can reliably classify entire rectangles in the complex plane as being on either side of the Julia set. The union of the rectangles that cannot be so classified is guaranteed to contain the Julia set. Our algorithm computes a refinable quadtree decomposition of the complex plane adapted to the Julia set which can be used for rendering and for approximating geometric properties such as the area of the filled Julia set and the fractal dimension of the Julia set.