Instead of using a ringbuffer for a polygon, where I need to copy elements when removing one item, I’d like to do this efficiently with a list, with O(1) overhead for removing any item and O(1) access to the currently updated next element without requiring special cases such as ringbuffer wrapping. No allocations are required.