Victor J. Milenkovic

Int. J. Comput. Geom. Appl., 2022

Efficient Predicate Evaluation using Statistical Degeneracy Detection.

[BibT_eX]

Proceedings of the 34th Canadian Conference on Computational Geometry, 2022

2019

Fast Detection of Degenerate Predicates in Free Space Construction.

[BibT_eX]

[DOI]

Nabeel Butt

Int. J. Comput. Geom. Appl., 2019

Geometric rounding and feature separation in meshes.

[BibT_eX]

[DOI]

Comput. Aided Des., 2019

2018

Table Based Detection of Degenerate Predicates in Free Space Construction.

[BibT_eX]

[DOI]

Nabeel Butt

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

Finding Intersections of Algebraic curves in a Convex Region using Encasement.

[BibT_eX]

[DOI]

Joseph Masterjohn

Proceedings of the 30th Canadian Conference on Computational Geometry, 2018

Approximate Free Space Construction and Maximum Clearance Path Planning for a Four Degree of Freedom Robot.

[BibT_eX]

[DOI]

Chloe Arluck

Proceedings of the 30th Canadian Conference on Computational Geometry, 2018

2017

Robust free space construction for a polyhedron with planar motion.

[BibT_eX]

[DOI]

Nabeel Butt

Comput. Aided Des., 2017

2015

Robust polyhedral Minkowski sums with GPU implementation.

[BibT_eX]

[DOI]

Min-Ho Kyung

Comput. Aided Des., 2015

2014

Robust cascading of operations on polyhedra.

[BibT_eX]

[DOI]

Comput. Aided Des., 2014

2013

Robust Free Space Computation for Curved Planar Bodies.

[BibT_eX]

[DOI]

Steven Trac

IEEE Trans Autom. Sci. Eng., 2013

Planar Shape Manipulation using Approximate Geometric Primitives.

[BibT_eX]

[DOI]

Steven Trac

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

Interactive visualization of 3D configuration spaces.

[BibT_eX]

[DOI]

Justin Stoecker

Proceedings of the Symposium on Computational Geometry 2013, 2013

2012

Robust Complete Path Planning in the Plane.

[BibT_eX]

[DOI]

Steven Trac

Proceedings of the Algorithmic Foundations of Robotics X, 2012

2011

Controlled linear perturbation.

[BibT_eX]

[DOI]

Min-Ho Kyung

Comput. Aided Des., 2011

Robust approximate assembly partitioning.

[BibT_eX]

[DOI]

Yujun Wu

Proceedings of the 23rd Annual Canadian Conference on Computational Geometry, 2011

2010

Two Approximate Minkowski Sum Algorithms.

[BibT_eX]

[DOI]

Int. J. Comput. Geom. Appl., 2010

Robust Minkowski sums of polyhedra via controlled linear perturbation.

[BibT_eX]

[DOI]

Min-Ho Kyung

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

2009

Rendering Animations with Distributed Applets.

[BibT_eX]

Adam McMahon

Proceedings of the 2009 International Conference on Computer Graphics & Virtual Reality, 2009

2007

A Monotonic Convolution for Minkowski Sums.

[BibT_eX]

[DOI]

Int. J. Comput. Geom. Appl., 2007

An Approximate Arrangement Algorithm for Semi-Algebraic Curves.

[BibT_eX]

[DOI]

Int. J. Comput. Geom. Appl., 2007

2004

A Fast Impulsive Contact Suite for Rigid Body Simulation.

[BibT_eX]

[DOI]

Harald Schmidl

IEEE Trans. Vis. Comput. Graph., 2004

2002

Densest translational lattice packing of non-convex polygons.

[BibT_eX]

[DOI]

Comput. Geom., 2002

2001

Optimization-based animation.

[BibT_eX]

[DOI]

Harald Schmidl

Proceedings of the 28th Annual Conference on Computer Graphics and Interactive Techniques, 2001

2000

Shortest Path Geometric Rounding.

[BibT_eX]

[DOI]

Algorithmica, 2000

Densest tanslational lattice packing of non-convex polygons (extended abstract).

[BibT_eX]

[DOI]

Proceedings of the Sixteenth Annual Symposium on Computational Geometry, 2000

1999

Rotational polygon containment and minimum enclosure using only robust 2D constructions.

[BibT_eX]

[DOI]

Comput. Geom., 1999

1998

Rotational polygon overlap minimization and compaction.

[BibT_eX]

[DOI]

Comput. Geom., 1998

Rotational Polygon Containment and Minimum Enclosure.

[BibT_eX]

[DOI]

Proceedings of the Fourteenth Annual Symposium on Computational Geometry, 1998

1997

Rational Orthogonal Approximations to Orthogonal Matrices.

[BibT_eX]

[DOI]

Veljko Milenkovic

Comput. Geom., 1997

Finding the Largest Area Axis-parallel Rectangle in a Polygon.

[BibT_eX]

[DOI]

Dan Roth

Comput. Geom., 1997

Multiple Translational Containment. Part II: Exact Algorithms.

[BibT_eX]

[DOI]

Algorithmica, 1997

Multiple Translational Containment. Part I: An Approximate Algorithm.

[BibT_eX]

[DOI]

Algorithmica, 1997

Rotational Polygon Overlap Minimization.

[BibT_eX]

[DOI]

Proceedings of the Thirteenth Annual Symposium on Computational Geometry, 1997

1996

Column-Based Strip Packing Using Ordered and Compliant Containment.

[BibT_eX]

[DOI]

Proceedings of the Applied Computational Geormetry, 1996

Translational Polygon Containment and Minimal Enclosure using Linear Programming Based Restriction.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Eighth Annual ACM Symposium on the Theory of Computing, 1996

Position-Based Physics: Simulating the Motion of Many Highly Interacting Spheres and Polyhedra.

[BibT_eX]

[DOI]

Proceedings of the 23rd Annual Conference on Computer Graphics and Interactive Techniques, 1996

Distance-based Subdivision for Translational LP Containment.

[BibT_eX]

[DOI]

Proceedings of the 8th Canadian Conference on Computational Geometry, 1996

1995

Multiple Translational Containment: Approximate and Exact Algorithms.

[BibT_eX]

[DOI]

Proceedings of the Sixth Annual ACM-SIAM Symposium on Discrete Algorithms, 1995

Position based physics animating and packing spheres inside polyhedra.

[BibT_eX]

[DOI]

Proceedings of the 7th Canadian Conference on Computational Geometry, 1995

Practical methods for set operations on polygons using exact arithmetic.

[BibT_eX]

[DOI]

Proceedings of the 7th Canadian Conference on Computational Geometry, 1995

1994

Limited Gaps.

[BibT_eX]

Proceedings of the 6th Canadian Conference on Computational Geometry, 1994

1993

Robust polygon modelling.

[BibT_eX]

[DOI]

Comput. Aided Des., 1993

A Compaction Algorithm for Non-Convex Polygons and Its Application.

[BibT_eX]

[DOI]

Zhenyu Li

Proceedings of the Ninth Annual Symposium on Computational GeometrySan Diego, 1993

Robust Construction of the Voronoi Diagram of a Polyhedron.

[BibT_eX]

Proceedings of the 5th Canadian Conference on Computational Geometry, 1993

The Complexity of the Compaction Problem.

[BibT_eX]

Zhenyu Li

Proceedings of the 5th Canadian Conference on Computational Geometry, 1993

Finding the Maximum Area Axis-parallel Rectangle in a Polygon.

[BibT_eX]

Dan Roth

Proceedings of the 5th Canadian Conference on Computational Geometry, 1993

An Experiment Using LN for Exact Geometric Computations.

[BibT_eX]

Jacqueline D. Chang

Proceedings of the 5th Canadian Conference on Computational Geometry, 1993

1992

Constructing Strongly Convex Hulls Using Exact or Rounded Arithmetic.

[BibT_eX]

[DOI]

Zhenyu Li

Algorithmica, 1992

1991

Numerical Stability of Algorithms for Line Arrangements.

[BibT_eX]

[DOI]

Steven Fortune

Proceedings of the Seventh Annual Symposium on Computational Geometry, 1991

1990

Asymptotically Tight Bounds for Computing with Faulty Arrays of Processors (Extended Abstract)

[BibT_eX]

[DOI]

Christos Kaklamanis

Anna R. Karlin

Frank Thomson Leighton

Proceedings of the 31st Annual Symposium on Foundations of Computer Science, 1990

Finding Compact Coordinate Representations for Polygons and Polyhedra.

[BibT_eX]

[DOI]

Lee R. Nackman

Proceedings of the Sixth Annual Symposium on Computational Geometry, 1990

1989

Double Precision Geometry: A General Technique for Calculating Line and Segment Intersections Using Rounded Arithmetic

[BibT_eX]

[DOI]

Proceedings of the 30th Annual Symposium on Foundations of Computer Science, Research Triangle Park, North Carolina, USA, 30 October, 1989

Calculating Approximate Curve Arrangements Using Rounded Arithmetic.

[BibT_eX]

[DOI]

Proceedings of the Fifth Annual Symposium on Computational Geometry, 1989

1988

Verifiable Implementations of Geometric Algorithms Using Finite Precision Arithmetic.

[BibT_eX]

[DOI]