Approximate Cell Decomposition

Approximate Cell Decomposition is a cell decomposition method in computational geometry and robotics that partitions the configuration space into non-overlapping regions, where the cells are approximated representations of free space, enabling efficient path planning through simplified geometric or topological abstractions.

49

Publications

2.8K

Citations

116

Authors

60

Institutions

Publications per year

2017–2026

8

Authors

116

  1. LZ
    Liangjun Zhang

    Baidu (China), China

    3 publications · 99 citations

    3

    h-index

  2. KR
    K. R. Guruprasad

    National Institute of Technology Karnataka, India

    3 publications · 83 citations

    3

    h-index

  3. DM
    Dinesh Manocha

    University of North Carolina at Chapel Hill, United States

    3 publications · 99 citations

    3

    h-index

  4. SF
    Silvio Ferrari

    Duke University, United States

    2 publications · 197 citations

    2

    h-index

  5. YG
    Yoav Gabriely

    Technion – Israel Institute of Technology, Israel

    2 publications · 499 citations

    2

    h-index

1–5 of 116

Venues

  1. Annals of Pure and Applied Logic

    2 publications · 77 citations

    2

    h-index

  2. Robotica

    2 publications · 66 citations

    2

    h-index

  3. Mechatronics

    1 publications · 219 citations

    1

    h-index

  4. International Journal of Advanced Robotic Systems

    ARS · 1 publications · 27 citations

    1

    h-index

  5. Repository for Publications and Research Data (ETH Zurich)

    Repository · 1 publications · 49 citations

    1

    h-index

1–5