The following pages link to Alon Efrat (Q293157):
Displayed 50 items.
- (Q178848) (redirect page) (← links)
- Separating and shattering long line segments (Q293158) (← links)
- Scandinavian thins on top of cake: new and improved algorithms for stacking and packing (Q489760) (← links)
- Guarding galleries and terrains (Q845875) (← links)
- On the union of \(\kappa\)-round objects in three and four dimensions (Q854705) (← links)
- On simultaneous planar graph embeddings (Q857060) (← links)
- On the performance of the ICP algorithm (Q934025) (← links)
- Geometric stable roommates (Q976079) (← links)
- On the union of fat wedges and separating a collection of segments by a line (Q1314526) (← links)
- Computing the smallest \(k\)-enclosing circle and related problems (Q1328752) (← links)
- Computing Euclidean bottleneck matchings in higher dimensions (Q1607062) (← links)
- Pattern matching for sets of segments (Q1762985) (← links)
- A near-linear algorithm for the planar segment-center problem (Q1816414) (← links)
- New similarity measures between polylines with applications to morphing and polygon sweeping (Q1864114) (← links)
- Covering with ellipses (Q1889588) (← links)
- On the union of \(\kappa\)-curved objects (Q1969596) (← links)
- On the complexity of the union of fat convex objects in the plane (Q1971503) (← links)
- Dynamic data structures for fat objects and their applications (Q1975962) (← links)
- Finding a guard that sees most and a shop that sells most (Q2369935) (← links)
- Curve matching, time warping, and light fields: New algorithms for computing similarity between curves (Q2384118) (← links)
- On incremental rendering of silhouette maps of a polyhedral scene (Q2385692) (← links)
- Nearest-neighbor searching under uncertainty. I (Q2411831) (← links)
- Computing homotopic shortest paths efficiently (Q2432731) (← links)
- (Q2768308) (← links)
- (Q2768363) (← links)
- Fly Cheaply: On the Minimum Fuel Consumption Problem (Q2775893) (← links)
- (Q2934699) (← links)
- Shortest path to a segment and quickest visibility queries (Q2970466) (← links)
- (Q3043714) (← links)
- On Approximate Geodesic-Distance Queries amid Deforming Point Clouds (Q3079488) (← links)
- Computing a Segment Center for a Planar Point Set (Q3141535) (← links)
- Improved Approximation Algorithms for Relay Placement (Q3541099) (← links)
- Touring a sequence of polygons (Q3581275) (← links)
- (Q3601527) (← links)
- SUBPIXEL IMAGE REGISTRATION USING CIRCULAR FIDUCIALS (Q4327387) (← links)
- (Q4335198) (← links)
- (Q4411377) (← links)
- Matching planar maps (Q4458868) (← links)
- (Q4471348) (← links)
- (Q4828967) (← links)
- Vertical Decomposition of Shallow Levels in 3-Dimensional Arrangements and Its Applications (Q4943852) (← links)
- (Q4952717) (← links)
- (Q4952719) (← links)
- Multi-level Steiner Trees (Q4984869) (← links)
- Polygons with Prescribed Angles in 2D and 3D (Q5014111) (← links)
- Polygons with Prescribed Angles in 2D and 3D (Q5050003) (← links)
- On the number of regular vertices of the union of Jordan regions (Q5054868) (← links)
- Computing the smallest k-enclosing circle and related problems (Q5060125) (← links)
- Dynamic data structures for fat objects and their applications (Q5096947) (← links)
- Multi-Level Steiner Trees. (Q5140725) (← links)