Polynomial system solving, sparse/toric elimination theory, structured matrices. Resultants reduce system solving to linear algebra.
Newton polytopes provide the bridge between algebra and combinatorial geometry.
Optimal sparse resultant matrices for
multihomogeneous polynomial systems
MAPLE software MHRES.
Macaulay-type formulae for sparse resultants of generalized unmixed systems
More Algebraic software.
Real solving, Real algebraic numbers.
Solvers based on Continued Fractions and Sturm sequences.
Software tools in C++
module Realroot, interval-Newton method,
solvers for polynomial systems (subdivision methods).
MAPLE software SLV for real algebraic numbers,
real solving of equations and bivariate systems.
Benchmarking of black-box univariate real solvers.
Geometric Modeling and Nonlinear Computational geometry.
Exact and approximate implicitization of parametric hypersurfaces by
interpolation using matrix operations, and sparse elimination for exploiting
Extensions to space curves and objects defined by point clouds
Voronoi diagrams of circles and ellipses
alpha-shapes for robust modeling of 3D objects,
arrangements of curved objects (talk)
Python projects and CGAL-Python bindings, including visibility tools:
Convex geometry in general dimension.
Random walks for approximating polytope volume (software).
Convex hull and symbolic perturbation, mixed volume
Regular fine mixed subdivisions of Minkowski sums,
regular triangulations, secondary polytopes, resultant polytopes
Minkowski decomposition (webpage):
optimal algorithms with a fixed-size summand, approximation of general (NP-hard) problem.
normals, faces, ridges, extreme or interior points
(module Polytopix in Mathemagix).
Geometric search in high dimensions.
kd-GeRaf: Generalized Randomized kd-trees for fast approximate
nearest-neighbors of points, in very high dimensions
(competitive in dimension of up to 10,000):
Dimensionality reduction by a weak version of the JL lemma,
and nearly-record complexity for ANN
Fast, high-dimensional, approximate $r$-nets
IQ-means: Clustering for big data: we improve k-means
by reverse assignment, combined with ideas from product quantization
(image), to cluster 100 Mil SIFT images in 1hr
(Software tool IQ-means,
paper at ICCV 2015).
Structure of Transmembrane proteins.
Geometric modelling of β-barrels and detection of the transmembrane region of a β-barrel transmembrane protein.
Given a PDB file, the transmembrane region is detected by profiling the external residues of the β-barrel along its axis in terms of hydrophobicity and existence of aromatic and charged residues.
Our geometric modeling of the barrel relies on combining
nonlinear least square minimization and a genetic algorithm.
TbB-Tool is the software tool.
is a software tool
for the prediction of protein binding sites.
It analyzes the solvent and its contacts with proteins
and defines clusters of water molecules,
which mark potentially exposed interaction and binding sites
of the protein.
Contact: Dr Thanassis Tartas.
Figure: black is the protein, colored are the oxygen atoms of clusters, red being the largest cluster.
Molecular conformations in Structural bioinformatics.
Enumeration of all possible conformations of (small) molecules/proteins under geometric constrains; C-Space
Determination of active sites by alpha-shapes, Sampling of rotamers,
and clustering to deduce structural determinants.
Paper by Emiris, Fritzilas, Manocha.
Graph embedding in Euclidean spaces, rigidity theory,
distance geometry to compute conformations from NMR data.
Robust calibration of parallel robots (by applying elimination techniques),
forward kinematics of Stewart/Gough platforms,
and design of robotic platforms for medical applications such as physiotherapy.