Most methods for computing offsets, bisectors, and medial axes of parametric curves in the plane are based on a local formulation of the distance to a curve. As a consequence, the computed objects may contain spurious parts and components, and have to be trimmed. We approach these problems as global optimization problems, and solve them using interval arithmetic, thus generating robust approxim...

– Qualitative examples showing recognition episodes in streaming environment. Also see our project webpage for video examples. (A) – Streaming recognition results with different detector speeds (B). – Un-trimmed detection results with different object detector speeds (C). – State feature and reward function design (D). – Details for policy iteration (E). – Details for observation imputation in ...

We formulate optical flow estimation as a two-stage regression problem. Based on characteristics of these two regression models and conclusions on modern regression methods, we choose a Least Trimmed Squares followed by weighted Least Squares estimator to solve the optical flow constraint (OFC); and at places where this one-stage robust method fails due to poor derivative quality, we use a Leas...

We present a method to handle cubic trimmed triangular Bézier patches. This scheme makes use of levels of detail and surface subdivision to achieve a fast and flexible hierarchical data structure that is specially useful to compute surface intersections in a robust and efficient way. The accuracy of the results can be adjusted by adding or subtracting elements to the levels of detail hierarchy,...

Penalty methods have proven to be particularly effective for achieving the required $C^1$-continuity in context of multi-patch isogeometric Kirchhoff-Love shells. Due their conceptual simplicity, these algorithms are readily applicable displacement and rotational coupling trimmed, non-conforming surfaces. However, accuracy resulting solution depends heavily on choice penalty parameters. Further...