Computational Geometry 

My involvement with computational geometry is quite restricted to the problem of mesh generation. In particular, I am mainly interested in meshing algorithms that generate provably good quality meshes of triangles/tetrahedra from imaging data. My first research work on mesh generation resulted in an algorithm for converting triangle meshes of polygonal regions into quadrilateral meshes of bounded size. This algorithm was developed in collaboration with Suneeta Ramaswami, who has been working with several instances of the tritoquad conversion problem for a long time. More recently, my collaboration with Dr. Ramaswami on an extension of the tritoquad conversion problem to surface meshes produced an algorithm for computing irreducible triangulations of compact, connected, and orientable surfaces with an empty boundary in Euclidean spaces. Currently, I am working on a new algorithm for computing Delaunay triangulations from planar regions delimited by smooth curves. This research has been conducted in collaboration with Älper Üngor and Serdar Ayaz (a current Ph.D. candidate under Dr. Üngor's advisory) at the University of Florida as part of the activities of my sabbatical year. Our meshing algorithm improves upon a previous algorithm given by Steve Pav and Noel Walkington in 2005 (see paper).


Ramaswami, S.; Siqueira, M.


Lizier, M.; Siqueira, M.; Daniels II, J.;
Silva, C.T.; Nonato, L.G.


Daniels II, J.; Lizier, M.; Siqueira, M.;
Silva, C.T.; Nonato, L.G.


Ramaswami, S.; Siqueira, M.; Sundaram, T.;
Gallier, J.; Gee, J.


Last update: August 19, 2017 