Generation of configuration space obstacles: The case of moving algebraic curves

DOI10.1007/BF01553884zbMath0672.68009OpenAlexW1962094193MaRDI QIDQ1120268

Myung-Soo Kim, Chanderjit L. Bajaj

Publication date: 1989

Published in: Algorithmica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01553884

zbMATH Keywords

configuration spacemotion planningcomputational geometryouter envelope

Mathematics Subject Classification ID

Computing methodologies and applications (68U99) Discrete mathematics in relation to computer science (68R99) Algorithms in computer science (68W99)

Related Items (9)

On determining optimal strategies in pursuit games in the plane ⋮ A unified algebraic framework for fast and precise planar swept volumes and Minkowski sums ⋮ An algebraic algorithm to compute the exact general sweep boundary of a 2D curved object ⋮ Exploring hypersurfaces with offset-like convolutions ⋮ Polygon decomposition for efficient construction of Minkowski sums ⋮ Closed-form characterization of the Minkowski sum and difference of two ellipsoids ⋮ On determining optimal strategies in pursuit games in the plane ⋮ Rational surfaces with linear normals and their convolutions with rational surfaces ⋮ Convex hulls of objects bounded by algebraic curves

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Computing convolutions by reciprocal search
• Automatic parameterization of rational curves and surfaces. I: Conics and conicoids
• Automatic parametrization of rational curves and surfaces. II: Cubics and cubicoids
• Tracing surface intersections
• Computation of powers of multivariate polynomials over the integers
• Spatial Planning: A Configuration Space Approach
• The Calculation of Multivariate Polynomial Resultants

This page was built for publication: Generation of configuration space obstacles: The case of moving algebraic curves