The following pages link to Ovidiu Daescu (Q185436):
Displaying 50 items.
- Maintaining visibility of a polygon with a moving point of view (Q293260) (← links)
- Largest area convex hull of imprecise data based on axis-aligned squares (Q386441) (← links)
- Minimum-sum dipolar spanning tree in \(\mathbb R^3\) (Q452446) (← links)
- Line facility location in weighted regions (Q543511) (← links)
- Polygonal chain approximation: A query based approach (Q706723) (← links)
- Algorithms for fair partitioning of convex polygons (Q896117) (← links)
- Farthest segments and extremal triangles spanned by points in \(\mathbb R^3\) (Q990950) (← links)
- A PTAS for cutting out polygons with lines (Q1014794) (← links)
- Efficient parallel algorithms for planar \(st\)-graphs (Q1400882) (← links)
- (Q1601005) (redirect page) (← links)
- Efficiently approximating polygonal paths in three and higher dimensions (Q1601006) (← links)
- Efficient algorithms and implementations for optimizing the sum of linear fractional functions, with applications (Q1774529) (← links)
- New results on path approximation (Q1889587) (← links)
- Characterization and computation of feasible trajectories for an articulated probe with a variable-length end segment (Q1984612) (← links)
- Two-dimensional closest pair problem: a closer look (Q2004080) (← links)
- New bounds on guarding problems for orthogonal polygons in the plane using vertex guards with halfplane vision (Q2044958) (← links)
- Trajectory planning for an articulated probe (Q2206741) (← links)
- Does a robot path have clearance C? (Q2327130) (← links)
- Altitude terrain guarding and guarding uni-monotone polygons (Q2331221) (← links)
- On some geometric problems of color-spanning sets (Q2392733) (← links)
- Dynamic minimum bichromatic separating circle (Q2424884) (← links)
- Proximity problems on line segments spanned by points (Q2489537) (← links)
- Farthest-point queries with geometric and combinatorial constraints (Q2489542) (← links)
- Polygonal path simplification with angle constraints (Q2571211) (← links)
- Extremal point queries with lines and line segments and related problems (Q2571215) (← links)
- Guarding disjoint orthogonal polygons in the plane (Q2692235) (← links)
- (Q2768318) (← links)
- (Q2783024) (← links)
- Algorithms for Fair Partitioning of Convex Polygons (Q2942381) (← links)
- NP-Completeness of Spreading Colored Points (Q3066143) (← links)
- Largest Area Convex Hull of Axis-Aligned Squares Based on Imprecise Data (Q3087950) (← links)
- Towards an optimal algorithm for recognizing Laman graphs (Q3184612) (← links)
- Dynamic Minimum Bichromatic Separating Circle (Q3467880) (← links)
- On Some City Guarding Problems (Q3511372) (← links)
- Line Facility Location in Weighted Regions (Q3511420) (← links)
- Visiting a Sequence of Points with a Bevel-Tip Needle (Q3557043) (← links)
- An Experimental Study of Weighted k-Link Shortest Path Algorithms (Q3564306) (← links)
- FRÉCHET DISTANCE PROBLEMS IN WEIGHTED REGIONS (Q3575372) (← links)
- A PTAS for Cutting Out Polygons with Lines (Q3591349) (← links)
- (Q3601580) (← links)
- Parallel Optimal Weighted Links (Q3611883) (← links)
- MINIMUM SEPARATION IN WEIGHTED SUBDIVISIONS (Q3628100) (← links)
- Modeling Optimal Beam Treatment with Weighted Regions for Bio-medical Applications (Q3628368) (← links)
- Line Segment Facility Location in Weighted Subdivisions (Q3638446) (← links)
- Fréchet Distance Problems in Weighted Regions (Q3652195) (← links)
- (Q4218406) (← links)
- (Q4252037) (← links)
- ON GEOMETRIC PATH QUERY PROBLEMS (Q4682151) (← links)
- (Q4739329) (← links)
- SPACE-EFFICIENT ALGORITHMS FOR APPROXIMATING POLYGONAL CURVES IN TWO-DIMENSIONAL SPACE (Q4818576) (← links)
