Ioannis Z. Emiris

Math. Comput. Sci., March, 2024

HydraProt: A New Deep Learning Tool for Fast and Accurate Prediction of Water Molecule Positions for Protein Structures.

[BibT_eX]

[DOI]

Andreas Zamanos

George Ioannakis

J. Chem. Inf. Model., 2024

2023

A Practical Algorithm for Volume Estimation based on Billiard Trajectories and Simulated Annealing.

[BibT_eX]

[DOI]

ACM J. Exp. Algorithmics, December, 2023

Near-neighbor preserving dimension reduction via coverings for doubling subsets of ℓ1.

[BibT_eX]

[DOI]

Vasilis Margonis

Theor. Comput. Sci., 2023

An asymptotic upper bound for graph embeddings.

[BibT_eX]

[DOI]

Charalambos Tzamos

Discret. Appl. Math., 2023

PartNeRF: Generating Part-Aware Editable 3D Shapes without 3D Supervision.

[BibT_eX]

[DOI]

Konstantinos Tertikas

CoRR, 2023

Practical volume approximation of high-dimensional convex bodies, applied to modeling portfolio dependencies and financial crises.

[BibT_eX]

[DOI]

Ludovic Calès

Comput. Geom., 2023

Fairness Aware Counterfactuals for Subgroups.

[BibT_eX]

[DOI]

Loukas Kavouras

Konstantinos Tsopelas

Dimitrios Rontogiannis

Dimitris Fotakis

Proceedings of the Advances in Neural Information Processing Systems 36: Annual Conference on Neural Information Processing Systems 2023, 2023

Generating Part-Aware Editable 3D Shapes without 3D Supervision.

[BibT_eX]

[DOI]

Konstantinos Tertikas

Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition, 2023

2022

New Upper Bounds for the Number of Embeddings of Minimally Rigid Graphs.

[BibT_eX]

[DOI]

Raimundas Vidunas

Discret. Comput. Geom., 2022

A Greedy Approach to the Canny-Emiris Formula.

[BibT_eX]

[DOI]

Carles Checa

Proceedings of the ISSAC '22: International Symposium on Symbolic and Algebraic Computation, Villeneuve-d'Ascq, France, July 4, 2022

Bounding the Number of Roots of Multi-Homogeneous Systems.

[BibT_eX]

[DOI]

Proceedings of the ISSAC '22: International Symposium on Symbolic and Algebraic Computation, Villeneuve-d'Ascq, France, July 4, 2022

2021

Multilinear polynomial systems: Root isolation and bit complexity.

[BibT_eX]

[DOI]

J. Symb. Comput., 2021

On the maximal number of real embeddings of minimally rigid graphs in R2, R3 and S2.

[BibT_eX]

[DOI]

J. Symb. Comput., 2021

The cross-sectional distribution of portfolio returns and applications.

[BibT_eX]

[DOI]

Ludovic Calès

CoRR, 2021

Modeling of Crisis Periods in Stock Markets.

[BibT_eX]

[DOI]

Emmanouil Christoforou

Theodore Dalamagas

Proceedings of the Learning and Intelligent Optimization - 15th International Conference, 2021

The m-Bézout Bound and Distance Geometry.

[BibT_eX]

[DOI]

Charalambos Tzamos

Proceedings of the Computer Algebra in Scientific Computing - 23rd International Workshop, 2021

2020

Products of Euclidean Metrics, Applied to Proximity Problems among Curves: Unified Treatment of Discrete Fréchet and Dynamic Time Warping Distances.

[BibT_eX]

[DOI]

ACM Trans. Spatial Algorithms Syst., 2020

Separation bounds for polynomial systems.

[BibT_eX]

[DOI]

J. Symb. Comput., 2020

Modeling asset allocation strategies and a new portfolio performance score.

[BibT_eX]

[DOI]

CoRR, 2020

Efficient Sampling from Feasible Sets of SDPs and Volume Approximation.

[BibT_eX]

[DOI]

Panagiotis Repouskos

CoRR, 2020

High-Dimensional Approximate r-Nets.

[BibT_eX]

[DOI]

Algorithmica, 2020

On the multihomogeneous Bézout bound on the number of embeddings of minimally rigid graphs.

[BibT_eX]

[DOI]

Josef Schicho

Appl. Algebra Eng. Commun. Comput., 2020

Practical Volume Estimation of Zonotopes by a New Annealing Schedule for Cooling Convex Bodies.

[BibT_eX]

[DOI]

Proceedings of the Mathematical Software - ICMS 2020, 2020

2019

Practical Volume Estimation by a New Annealing Schedule for Cooling Convex Bodies.

[BibT_eX]

[DOI]

CoRR, 2019

Near neighbor preserving dimension reduction for doubling subsets of $\ell_1$.

[BibT_eX]

[DOI]

Vasilis Margonis

CoRR, 2019

15 PhD positions in GRAPES: learning, processing & optimising shapes.

[BibT_eX]

[DOI]

ACM Commun. Comput. Algebra, 2019

Implicit representations of high-codimension varieties.

[BibT_eX]

[DOI]

Clément Laroche

Comput. Aided Geom. Des., 2019

Voronoi Diagram of Orthogonal Polyhedra in Two and Three Dimensions.

[BibT_eX]

[DOI]

Christina Katsamaki

Proceedings of the Analysis of Experimental Algorithms - Special Event, 2019

Neural Networks for Cryptocurrency Evaluation and Price Fluctuation Forecasting.

[BibT_eX]

[DOI]

Emmanouil Christoforou

Apostolos Florakis

Proceedings of the 1st International Conference on Mathematical Research for Blockchain Economy, 2019

Near-Neighbor Preserving Dimension Reduction for Doubling Subsets of l1.

[BibT_eX]

[DOI]

Vasilis Margonis

Proceedings of the Approximation, 2019

2018

Practical Polytope Volume Approximation.

[BibT_eX]

[DOI]

ACM Trans. Math. Softw., 2018

Randomized Embeddings with Slack and High-Dimensional Approximate Nearest Neighbor.

[BibT_eX]

[DOI]

ACM Trans. Algorithms, 2018

Algorithms for Deciding Membership in Polytopes of General Dimension.

[BibT_eX]

[DOI]

CoRR, 2018

On the Maximal Number of Real Embeddings of Spatial Minimally Rigid Graphs.

[BibT_eX]

[DOI]

Proceedings of the 2018 ACM on International Symposium on Symbolic and Algebraic Computation, 2018

Polytope Membership in High Dimension.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Optimization - 5th International Symposium, 2018

Products of Euclidean Metrics and Applications to Proximity Questions among Curves.

[BibT_eX]

[DOI]

Proceedings of the 34th International Symposium on Computational Geometry, 2018

Practical Volume Computation of Structured Convex Bodies, and an Application to Modeling Portfolio Dependencies and Financial Crises.

[BibT_eX]

[DOI]

Ludovic Calès

Proceedings of the 34th International Symposium on Computational Geometry, 2018

2017

Approximating Multidimensional Subset Sum and Minkowski Decomposition of Polygons.

[BibT_eX]

[DOI]

Anna Karasoulou

Charilaos Tzovas

Math. Comput. Sci., 2017

High-dimensional approximate r-nets.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, 2017

Matrix Representations by Means of Interpolation.

[BibT_eX]

[DOI]

Proceedings of the 2017 ACM on International Symposium on Symbolic and Algebraic Computation, 2017

2016

Efficient edge-skeleton computation for polytopes defined by oracles.

[BibT_eX]

[DOI]

Bernd Gärtner

J. Symb. Comput., 2016

High-dimensional approximate nearest neighbor: k-d Generalized Randomized Forests.

[BibT_eX]

[DOI]

Yannis Avrithis

Georgios Samaras

CoRR, 2016

Practical linear-space Approximate Near Neighbors in high dimension.

[BibT_eX]

[DOI]

CoRR, 2016

On the Bit Complexity of Solving Bilinear Polynomial Systems.

[BibT_eX]

[DOI]

Proceedings of the ACM on International Symposium on Symbolic and Algebraic Computation, 2016

Compact Formulae in Sparse Elimination.

[BibT_eX]

[DOI]

Proceedings of the ACM on International Symposium on Symbolic and Algebraic Computation, 2016

High-dimensional visual similarity search: k-d Generalized Randomized Forests.

[BibT_eX]

[DOI]

Yannis Avrithis

Georgios Samaras

Proceedings of the Short Paper Proceedings of the 33rd Computer Graphics International, Heraklion, Greece, June 28, 2016

2015

Geometric operations using sparse interpolation matrices.

[BibT_eX]

[DOI]

Graph. Model., 2015

Research workshop on algebraic representations in computer-aided design for complex shapes.

[BibT_eX]

[DOI]

ACM Commun. Comput. Algebra, 2015

Minkowski Decomposition and Geometric Predicates in Sparse Implicitization.

[BibT_eX]

[DOI]

Zafeirakis Zafeirakopoulos

Proceedings of the 2015 ACM on International Symposium on Symbolic and Algebraic Computation, 2015

Web-Scale Image Clustering Revisited.

[BibT_eX]

[DOI]

Yannis Avrithis

Yannis Kalantidis

Proceedings of the 2015 IEEE International Conference on Computer Vision, 2015

Low-Quality Dimension Reduction and High-Dimensional Approximate Nearest Neighbor.

[BibT_eX]

[DOI]

Proceedings of the 31st International Symposium on Computational Geometry, 2015

2014

Counting Euclidean embeddings of rigid graphs.

[BibT_eX]

[DOI]

CoRR, 2014

Sparse implicitization by interpolation: Geometric computations using matrix representations.

[BibT_eX]

[DOI]

CoRR, 2014

Matrix Methods for Solving Algebraic Systems.

[BibT_eX]

[DOI]

CoRR, 2014

Root counts of semi-mixed systems, and an application to counting nash equilibria.

[BibT_eX]

[DOI]

Raimundas Vidunas

Proceedings of the International Symposium on Symbolic and Algebraic Computation, 2014

Efficient Random-Walk Methods for Approximating Polytope Volume.

[BibT_eX]

[DOI]

Proceedings of the 30th Annual Symposium on Computational Geometry, 2014

Algebraic Algorithms.

[BibT_eX]

Proceedings of the Computing Handbook, 2014

2013

Implicitization of curves and (hyper)surfaces using predicted support.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2013

Special issue on symbolic and algebraic computation: Foundations, algorithmics and applications: ISSAC 2011.

[BibT_eX]

[DOI]

Éric Schost

J. Symb. Comput., 2013

An Oracle-Based, output-Sensitive Algorithm for Projections of Resultant Polytopes.

[BibT_eX]

[DOI]

Luis Mariano Peñaranda

Int. J. Comput. Geom. Appl., 2013

Plane mixed discriminants and toric jacobians

[BibT_eX]

[DOI]

Anna Karasoulou

CoRR, 2013

Chapter 10: Algebraic Algorithms.

[BibT_eX]

[DOI]

CoRR, 2013

Exact Voronoi diagram of smooth convex pseudo-circles: General predicates, and implementation for ellipses.

[BibT_eX]

[DOI]

Comput. Aided Geom. Des., 2013

Voronoi diagrams of algebraic distance fields.

[BibT_eX]

[DOI]

Comput. Aided Des., 2013

Sparse implicitization by interpolation: Characterizing non-exactness and an application to computing discriminants.

[BibT_eX]

[DOI]

Comput. Aided Des., 2013

Combinatorics of 4-dimensional resultant polytopes.

[BibT_eX]

[DOI]

Proceedings of the International Symposium on Symbolic and Algebraic Computation, 2013

Mixed Volume and Distance Geometry Techniques for Counting Euclidean Embeddings of Rigid Graphs.

[BibT_eX]

[DOI]

Antonios Varvitsiotis

Proceedings of the Distance Geometry: Theory, Methods, and Applications, 2013

2012

Multihomogeneous resultant formulae for systems with scaled support.

[BibT_eX]

[DOI]

J. Symb. Comput., 2012

A General Solver Based on Sparse Resultants

[BibT_eX]

[DOI]

CoRR, 2012

Sparse implicitization using support prediction.

[BibT_eX]

[DOI]

ACM Commun. Comput. Algebra, 2012

Yet another algorithm for generalized Voronoï Diagrams.

[BibT_eX]

[DOI]

Proceedings of the ACM Symposium on Applied Computing, 2012

An output-sensitive algorithm for computing projections of resultant polytopes.

[BibT_eX]

[DOI]

Luis Mariano Peñaranda

Proceedings of the 28th ACM Symposium on Computational Geometry, 2012

2011

Single-lifting Macaulay-type formulae of generalized unmixed sparse resultants.

[BibT_eX]

[DOI]

J. Symb. Comput., 2011

Efficient Computation of Newton Polytopes of Specialized Resultants

[BibT_eX]

[DOI]

Luis Mariano Peñaranda

CoRR, 2011

Implicitization of curves and surfaces using predicted support.

[BibT_eX]

[DOI]

Proceedings of the SNC 2011, 2011

2010

Computing the Newton Polygon of the Implicit Equation.

[BibT_eX]

[DOI]

Leonidas Palios

Math. Comput. Sci., 2010

The assembly modes of rigid 11-bar linkages

[BibT_eX]

[DOI]

Guillaume Moroz

CoRR, 2010

The DMM bound: multivariate (aggregate) separation bounds.

[BibT_eX]

[DOI]

Proceedings of the Symbolic and Algebraic Computation, International Symposium, 2010

Random polynomials and expected complexity of bisection methods for real solving.

[BibT_eX]

[DOI]

André Galligo

Proceedings of the Symbolic and Algebraic Computation, International Symposium, 2010

2009

On the asymptotic and practical complexity of solving bivariate systems over the reals.

[BibT_eX]

[DOI]

Dimitrios I. Diochnos

J. Symb. Comput., 2009

Experimental evaluation and cross-benchmarking of univariate real solvers.

[BibT_eX]

[DOI]

Michael Hemmer

Zafeirakis Zafeirakopoulos

Menelaos I. Karavelas

Proceedings of the Symbolic Numeric Computation, 2009

Exact Delaunay graph of smooth convex pseudo-circles: general predicates, and implementation for ellipses.

[BibT_eX]

[DOI]

Proceedings of the 2009 ACM Symposium on Solid and Physical Modeling, 2009

Algebraic Methods for Counting Euclidean Embeddings of Rigid Graphs.

[BibT_eX]

[DOI]

Antonios Varvitsiotis

Proceedings of the Graph Drawing, 17th International Symposium, 2009

2008

On the complexity of real root isolation using continued fractions.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2008

Real algebraic numbers and polynomial systems of small degree.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2008

The Predicates for the Exact Voronoi Diagram of Ellipses under the Euclidiean Metric.

[BibT_eX]

[DOI]

Int. J. Comput. Geom. Appl., 2008

Editorial.

[BibT_eX]

[DOI]

Leonidas Palios

Comput. Geom., 2008

Computing a rational in between.

[BibT_eX]

[DOI]

ACM Commun. Comput. Algebra, 2008

Exact and efficient evaluation of the InCircle predicate for parametric ellipses and smooth convex objects.

[BibT_eX]

[DOI]

Comput. Aided Des., 2008

Real Algebraic Numbers: Complexity Analysis and Experimentation.

[BibT_eX]

[DOI]

Proceedings of the Reliable Implementation of Real Number Algorithms: Theory and Practice, 2008

A parallel robot for ankle rehabilitation-evaluation and its design specifications.

[BibT_eX]

[DOI]

Christos E. Syrseloudis

Proceedings of the 8th IEEE International Conference on Bioinformatics and Bioengineering, 2008

2007

A real-time and exact implementation of the predicates for the Voronoi diagram of parametric ellipses.

[BibT_eX]

[DOI]

Proceedings of the 2007 ACM Symposium on Solid and Physical Modeling, 2007

On the complexity of real solving bivariate systems.

[BibT_eX]

[DOI]

Dimitrios I. Diochnos

Proceedings of the Symbolic and Algebraic Computation, International Symposium, 2007

Protein Structure Prediction Using Residual Dipolar Couplings.

[BibT_eX]

[DOI]

Sotirios I. Pantos

Proceedings of the Algebraic Biology, Second International Conference, 2007

2006

The predicates of the Apollonius diagram: Algorithmic analysis and implementation.

[BibT_eX]

[DOI]

Menelaos I. Karavelas

Comput. Geom., 2006

beta-Barrel transmembrane proteins: Geometric modelling, detection of transmembrane region, and structural properties.

[BibT_eX]

[DOI]

Ioannis K. Valavanis

Pantelis G. Bagos

Panagiotis Angelikopoulos

Comput. Biol. Chem., 2006

Symbolic Computations in Volterra System Identification.

[BibT_eX]

[DOI]

Kimon Kontosis

Panos Koukoulas

Nicholas Kalouptsidis

Proceedings of the 2006 IEEE International Conference on Acoustics Speech and Signal Processing, 2006

Univariate Polynomial Real Root Isolation: Continued Fractions Revisited.

[BibT_eX]

[DOI]

Proceedings of the Algorithms, 2006

The predicates for the Voronoi diagram of ellipses.

[BibT_eX]

[DOI]

Proceedings of the 22nd ACM Symposium on Computational Geometry, 2006

Distributed Routing in Tree Networks with Few Landmarks.

[BibT_eX]

[DOI]

Euripides Markou

Aris Pagourtzis

Proceedings of the Combinatorial and Algorithmic Aspects of Networking, Third Workshop, 2006

Minkowski decomposition of convex lattice polygons.

[BibT_eX]

[DOI]

Proceedings of the Algebraic Geometry and Geometric Modeling, 2006

2005

Improved algorithms for computing determinants and resultants.

[BibT_eX]

[DOI]

J. Complex., 2005

Computations with one and two real algebraic numbers

[BibT_eX]

[DOI]

CoRR, 2005

Apollonius circle conflict.

[BibT_eX]

[DOI]

SIGSAM Bull., 2005

Successive Linear Programs for Computing All Integral Points in a Minkowski Sum.

[BibT_eX]

[DOI]

Kyriakos Zervoudakis

Proceedings of the Advances in Informatics, 2005

The Offset to an Algebraic Curve and an Application to Conics.

[BibT_eX]

[DOI]

Proceedings of the Computational Science and Its Applications, 2005

Algebraic study of the Apollonius circle of three ellipses.

[BibT_eX]

[DOI]

Proceedings of the (Informal) Proceedings of the 21st European Workshop on Computational Geometry, 2005

Real Solving of Bivariate Polynomial Systems.

[BibT_eX]

[DOI]

Proceedings of the Computer Algebra in Scientific Computing, 8th International Workshop, 2005

2004

Preface: Algebraic and Numerical Algorithms.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2004

Comparing Real Algebraic Numbers of Small Degree.

[BibT_eX]

[DOI]

Proceedings of the Algorithms, 2004

Towards and open curved kernel.

[BibT_eX]

[DOI]

Proceedings of the 20th ACM Symposium on Computational Geometry, 2004

2003

Multihomogeneous resultant formulae by means of complexes.

[BibT_eX]

[DOI]

J. Symb. Comput., 2003

Root comparison techniques applied to computing the additively weighted Voronoi diagram.

[BibT_eX]

[DOI]

Menelaos I. Karavelas

Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2003

Implicit Polynomial Support Optimized for Sparseness.

[BibT_eX]

[DOI]

Ilias S. Kotsireas

Proceedings of the Computational Science and Its Applications, 2003

Implicitization Exploiting Sparseness.

[BibT_eX]

[DOI]

Ilias S. Kotsireas

Proceedings of the Geometric and Algorithmic Aspects of Computer-Aided Design and Manufacturing, 2003

Discrete Geometry for Algebraic Elimination.

[BibT_eX]

Proceedings of the Algebra, Geometry, and Software Systems [outcome of a Dagstuhl seminar], 2003

Sparse Resultant Perturbations.

[BibT_eX]

Carlos D'Andrea

Proceedings of the Algebra, Geometry, and Software Systems [outcome of a Dagstuhl seminar], 2003

2002

Symbolic and Numeric Methods for Exploiting Structure in Constructing Resultant Matrices.

[BibT_eX]

[DOI]

J. Symb. Comput., 2002

Hybrid Sparse Resultant Matrices for Bivariate Polynomials.

[BibT_eX]

[DOI]

Carlos D'Andrea

J. Symb. Comput., 2002

Enumerating a subset of the integer points inside a Minkowski sum.

[BibT_eX]

[DOI]

Comput. Geom., 2002

Multihomogeneous resultant matrices.

[BibT_eX]

[DOI]

Proceedings of the Symbolic and Algebraic Computation, 2002

2001

Hybrid sparse resultant matrices for bivariate systems.

[BibT_eX]

[DOI]

Carlos D'Andrea

Proceedings of the 2001 International Symposium on Symbolic and Algebraic Computation, 2001

Robust parallel robot calibration with partial information.

[BibT_eX]

[DOI]

David Daney

Proceedings of the 2001 IEEE International Conference on Robotics and Automation, 2001

Matrix Methods for Solving Algebraic Systems.

[BibT_eX]

[DOI]

Proceedings of the Symbolic Algebraic Methods and Verification Methods, 2001

2000

A subdivision-based algorithm for the sparse resultant.

[BibT_eX]

[DOI]

J. ACM, 2000

Computing integer points in Minkowski sums.

[BibT_eX]

[DOI]

Proceedings of the Sixteenth Annual Symposium on Computational Geometry, 2000

1999

Sign Determination in Residue Number Systems.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1999

Matrices in Elimination Theory.

[BibT_eX]

[DOI]

J. Symb. Comput., 1999

How to Count Efficiently all Affine Roots of a Polynomial System.

[BibT_eX]

[DOI]

Jan Verschelde

Discret. Appl. Math., 1999

Computer Algebra Methods for Studying and Computing Molecular Conformations.

[BibT_eX]

[DOI]

Algorithmica, 1999

Applications of FFT.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Theory of Computation Handbook., 1999

Algebraic Algorithms.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Theory of Computation Handbook., 1999

1998

Modular Arithmetic for Linear Algebra Computations in the Real Field.

[BibT_eX]

[DOI]

Yanqiang Yu

J. Symb. Comput., 1998

A Complete Implementation for Computing General Dimensional Convex Hulls.

[BibT_eX]

[DOI]

Int. J. Comput. Geom. Appl., 1998

MARS: A MAPLE/MATLAB/C Resultant-Based Solver.

[BibT_eX]

[DOI]

Aaron S. Wallack

Dinesh Manocha

Proceedings of the 1998 International Symposium on Symbolic and Algebraic Computation, 1998

1997

Efficient Perturbations for Handling Geometric Degeneracies.

[BibT_eX]

[DOI]

Raimund Seidel

Algorithmica, 1997

The Structure of Sparse Resultant Matrices.

[BibT_eX]

[DOI]

Proceedings of the 1997 International Symposium on Symbolic and Algebraic Computation, 1997

Computing Exact Geometric Predicates Using Modular Arithmetic with Single Precision.

[BibT_eX]

[DOI]

Proceedings of the Thirteenth Annual Symposium on Computational Geometry, 1997

1996

On the Complexity of Sparse Elimination.

[BibT_eX]

[DOI]

J. Complex., 1996

Book Review: Polynomial and Matrix Computations Volume 1: Fundamental Algorithms by D. Bini and V. Pan.

[BibT_eX]

[DOI]

André Galligo

SIGSAM Bull., 1996

1995

A General Approach to Removing Degeneracies.

[BibT_eX]

[DOI]

SIAM J. Comput., 1995

Efficient Inceremtal Algorithms for the Sparse Resultant and the Mixed Volume.

[BibT_eX]

[DOI]

J. Symb. Comput., 1995

1994

Monomial Bases and Polynomial System Solving (extended abstract).

[BibT_eX]

[DOI]

Ashutosh Rege

Proceedings of the International Symposium on Symbolic and Algebraic Computation, 1994

1993

A Practical Method for the Sparse Resultant.

[BibT_eX]

[DOI]

Proceedings of the 1993 International Symposium on Symbolic and Algebraic Computation, 1993

An Efficient Algorithm for the Sparse Mixed Resultant.

[BibT_eX]

[DOI]

Proceedings of the Applied Algebra, 1993

1992

An Efficient Approach to Removing Geometric Degeneracies.

[BibT_eX]

[DOI]