Fetching the paper…
Reading the bibliography…
Convex polytopes have compact representations and exhibit convexity, which makes them suitable for abstracting obstacle-free spaces from various environments.
A. C. Jones, An introduction to algebraical geometry . Clarendon Press, 1912
1912
Earlier work this paper cites.
F. Klein, C. A. T. Noble, and E. R. T. Hedrick, Elementary Mathematics from an Advanced Standpoint-Geometry: Transl. from the Third German Ed. by ER Hedrick and CA Noble . Dover, 1939
1939
Earlier work this paper cites.
A. S. Householder, “Unitary triangularization of a nonsymmetric matrix,” Journal of the ACM (JACM) , vol. 5, no. 4, pp. 339–342, 1958
1958
Earlier work this paper cites.
H. W. Lenstra Jr, “Integer programming with a fixed number of variables,” Mathematics of operations research , vol. 8, no. 4, pp. 538–548, 1983
1983
Earlier work this paper cites.
L. Lovász, An algorithmic theory of numbers, graphs and convexity . SIAM, 1986
1986
Earlier work this paper cites.
J.-S. Chang and C.-K. Yap, “A polynomial solution for the potato-peeling problem,” Discrete & Computational Geometry , vol. 1, no. 2, pp. 155–182, 1986
1986
Earlier work this paper cites.
S. P. Tarasov, “The method of inscribed ellipsoids,” in Soviet Mathematics-Doklady , vol. 37, no. 1, 1988, pp. 226–230
1988
Earlier work this paper cites.
M. E. Dyer and A. M. Frieze, “On the complexity of computing the volume of a polyhedron,” SIAM Journal on Computing , vol. 17, no. 5, pp. 967–974, 1988
1988
Earlier work this paper cites.
L. G. Khachiyan and M. J. Todd, “On the complexity of approximating the maximal inscribed ellipsoid for a polytope,” Cornell University Operations Research and Industrial Engineering, Tech. Rep., 1990
1990
Earlier work this paper cites.
J. Lagarias and R. Vanderbei, “Ii dikin’s convergence result for the affine scaling algorithm,” Contemp. Math , vol. 114, p. 109, 1990
1990
Earlier work this paper cites.
R. Seidel, “Small-dimensional linear programming and convex hulls made easy,” Discrete & Computational Geometry , vol. 6, no. 3, pp. 423–434, 1991
1991
Earlier work this paper cites.
M. Sharir and E. Welzl, “A combinatorial bound for linear programming and related problems,” in STACS 92: 9th Annual Symposium on Theoretical Aspects of Computer Science Cachan, France, February 13–15, 1992 Proceedings 9 . Springer, 1992, pp. 567–579
1992
Earlier work this paper cites.
J. Matoušek, M. Sharir, and E. Welzl, “A subexponential bound for linear programming,” in Proceedings of the eighth annual symposium on Computational geometry , 1992, pp. 1–8
1992
Earlier work this paper cites.
L. G. Khachiyan and M. J. Todd, “On the complexity of approximating the maximal inscribed ellipsoid for a polytope,” Mathematical Programming , vol. 61, no. 1, pp. 137–159, 1993
1993
Earlier work this paper cites.
Y. Nesterov and A. Nemirovskii, Interior-Point Polynomial Algorithms in Convex Programming . SIAM, 1994
1994
Earlier work this paper cites.
C. B. Barber, D. P. Dobkin, and H. Huhdanpaa, “The quickhull algorithm for convex hulls,” ACM Transactions on Mathematical Software (TOMS) , vol. 22, no. 4, pp. 469–483, 1996
1996
Earlier work this paper cites.
T. Tsuchiya and R. D. C. Monteiro, “Superlinear convergence of the affine scaling algorithm,” Mathematical Programming , vol. 75, no. 1, pp. 77–110, 1996
1996
Earlier work this paper cites.
A. Nemirovski, “On self-concordant convex–concave functions,” Optimization Methods and Software , vol. 11, no. 1-4, pp. 303–384, 1999
1999
Earlier work this paper cites.
A. Ben-Tal and A. Nemirovski, Lectures on Modern Convex Optimization: Analysis, Algorithms, and Engineering Applications . SIAM, 2001
2001
Earlier work this paper cites.
J. C. Hart, “Perlin noise pixel shaders,” in Proceedings of the ACM SIGGRAPH/EUROGRAPHICS workshop on Graphics hardware , 2001, pp. 87–94
2001
Earlier work this paper cites.
K. M. Anstreicher, “Improved complexity for maximum volume inscribed ellipsoids,” SIAM Journal on Optimization , vol. 13, no. 2, pp. 309–320, 2002
2002
Earlier work this paper cites.
Y. Zhang and L. Gao, “On numerical solution of the maximum volume ellipsoid problem,” SIAM Journal on Optimization , vol. 14, no. 1, pp. 53–76, 2003
2003
Earlier work this paper cites.
S. Boyd and L. Vandenberghe, Convex Optimization . Cambridge University Press, 2004
2004
Cited alongside, same era.
E. Welzl, “Smallest enclosing disks (balls and ellipsoids),” in New Results and New Trends in Computer Science: Graz, Austria, June 20–21, 1991 Proceedings . Springer, 2005, pp. 359–370
2005
Cited alongside, same era.
A. Horwitz, “Ellipses of maximal area and of minimal eccentricity inscribed in a convex quadrilateral,” Australian Journal of Mathematical Analysis and Applications , vol. 2, no. 1, p. 12, 2005
2005
Cited alongside, same era.
P. E. Gill, W. Murray, and M. A. Saunders, “Snopt: An sqp algorithm for large-scale constrained optimization,” SIAM review , vol. 47, no. 1, pp. 99–131, 2005
2005
Cited alongside, same era.
S. Katz, A. Tal, and R. Basri, “Direct visibility of point sets,” in ACM SIGGRAPH 2007 papers , 2007, pp. 24–es
2007
C. D. Toth, J. O’Rourke, and J. E. Goodman, Handbook of Discrete and Computational Geometry . CRC Press, 2017
2017
Later among the works it cites.
C.-H. Lin, R. Wu, W.-K. Ma, C.-Y. Chi, and Y. Wang, “Maximum volume inscribed ellipsoid: A new simplex-structured matrix factorization framework via facet enumeration and convex optimization,” SIAM Journal on Imaging Sciences , vol. 11, no. 2, pp. 1651–1679, 2018
2018
Later among the works it cites.
M. J. D. Hayes, Z. A. Copeland, P. J. Zsombor-Murray, and A. Gfrerrer, “Largest area ellipse inscribing an arbitrary convex quadrangle,” in Advances in Mechanism and Machine Science: Proceedings of the 15th IFToMM World Congress on Mechanism and Machine Science 15 . Springer, 2019, pp. 239–248
2019
Later among the works it cites.
F. Gao, L. Wang, B. Zhou, X. Zhou, J. Pan, and S. Shen, “Teach-Repeat-Replan: A complete and robust system for aggressive flight in complex environments,” IEEE Transactions on Robotics , vol. 36, no. 5, pp. 1526–1545, 2020
2020
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Cited alongside, same era.
D. Minda and S. Phelps, “Triangles, ellipses, and cubic polynomials,” The American Mathematical Monthly , vol. 115, no. 8, pp. 679–689, 2008
2008
Cited alongside, same era.
A. Beck and M. Teboulle, “A fast iterative shrinkage-thresholding algorithm for linear inverse problems,” SIAM journal on imaging sciences , vol. 2, no. 1, pp. 183–202, 2009
2009
Cited alongside, same era.
A. Fabri and S. Pion, “Cgal: The computational geometry algorithms library,” in Proceedings of the 17th ACM SIGSPATIAL international conference on advances in geographic information systems , 2009, pp. 538–539
2009
Cited alongside, same era.
J. Richter-Gebert and J. Richter-Gebert, “Conics and their duals,” Perspectives on projective geometry: A guided tour through real and complex geometry , pp. 145–166, 2011
2011
Cited alongside, same era.
S. Karaman and E. Frazzoli, “Sampling-based algorithms for optimal motion planning,” The international journal of robotics research , vol. 30, no. 7, pp. 846–894, 2011
2011
Cited alongside, same era.
R. A. Horn and C. R. Johnson, Matrix Analysis . Cambridge University Press, 2012
2012
Cited alongside, same era.
G. H. Golub and F. V. Loan, Matrix Computations . The Johns Hopkins University Press, 2013
2013
Cited alongside, same era.
Later among the works it cites.
2020
Later among the works it cites.
B. Stellato, G. Banjac, P. Goulart, A. Bemporad, and S. Boyd, “Osqp: An operator splitting solver for quadratic programs,” Mathematical Programming Computation , pp. 1–36, 2020
2020
Later among the works it cites.
G. Frison and M. Diehl, “Hpipm: a high-performance quadratic programming framework for model predictive control,” IFAC-PapersOnLine , vol. 53, no. 2, pp. 6563–6569, 2020
2020
Later among the works it cites.
MOSEK Aps, “MOSEK Optimizer API for C,” 2020. [Online]. Available: https://www.mosek.com
2020
Later among the works it cites.
Z. Wang, X. Zhou, C. Xu, and F. Gao, “Geometrically constrained trajectory optimization for multicopters,” IEEE Transactions on Robotics , vol. 38, no. 5, pp. 3259–3278, 2022
2022
Later among the works it cites.
J. Guo, Z. Xun, S. Geng, Y. Lin, C. Xu, and F. Gao, “Dynamic free-space roadmap for safe quadrotor motion planning,” in 2022 IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS) . IEEE, 2022, pp. 10 523–10 528
2022
Later among the works it cites.
J. Ji, N. Pan, C. Xu, and F. Gao, “Elastic tracker: A spatio-temporal trajectory planner for flexible aerial tracking,” in 2022 International Conference on Robotics and Automation (ICRA) . IEEE, 2022, pp. 47–53
2022
Later among the works it cites.
W. Xu, Y. Cai, D. He, J. Lin, and F. Zhang, “Fast-lio2: Fast direct lidar-inertial odometry,” IEEE Transactions on Robotics , vol. 38, no. 4, pp. 2053–2073, 2022
2022
Later among the works it cites.
T. Marcucci, M. Petersen, D. von Wrangel, and R. Tedrake, “Motion planning around obstacles with convex optimization,” Science robotics , vol. 8, no. 84, p. eadf7843, 2023
2023
Later among the works it cites.
Z. Han, Y. Wu, T. Li, L. Zhang, L. Pei, L. Xu, C. Li, C. Ma, C. Xu, S. Shen et al. , “An efficient spatial-temporal trajectory planner for autonomous vehicles in unstructured environments,” IEEE Transactions on Intelligent Transportation Systems , 2023
2023
Later among the works it cites.
H. Dai, A. Amice, P. Werner, A. Zhang, and R. Tedrake, “Certified polyhedral decompositions of collision-free configuration space,” The International Journal of Robotics Research , p. 02783649231201437, 2023
2023
Later among the works it cites.
2023
Later among the works it cites.
J. Lin, C. Yuan, Y. Cai, H. Li, Y. Ren, Y. Zou, X. Hong, and F. Zhang, “Immesh: An immediate lidar localization and meshing framework,” IEEE Transactions on Robotics , 2023
2023
Later among the works it cites.
Q. Wang, Z. Wang, L. Pei, C. Xu, and F. Gao, “A linear and exact algorithm for whole-body collision evaluation via scale optimization,” in 2023 IEEE International Conference on Robotics and Automation (ICRA) . IEEE, 2023, pp. 3621–3627
2023
Later among the works it cites.
P. Werner, A. Amice, T. Marcucci, D. Rus, and R. Tedrake, “Approximating robot configuration spaces with few convex sets using clique covers of visibility graphs,” in 2024 IEEE International Conference on Robotics and Automation (ICRA) . IEEE, 2024, pp. 10 359–10 365
2024
Closest in time.
2024
Closest in time.