The following pages link to Marco Pellegrini (Q878712):
Displaying 28 items.
- (Q676267) (redirect page) (← links)
- On counting pairs of intersecting segments and off-line triangle range searching (Q676268) (← links)
- Georoy: A location-aware enhancement to Viceroy peer-to-peer algorithm (Q878715) (← links)
- Faster deterministic wakeup in multiple access channels (Q881569) (← links)
- Finding stabbing lines in 3-space (Q1193706) (← links)
- On the zone of a surface in a hyperplane arrangement (Q1209841) (← links)
- On numerical approximation of electrostatic energy in 3D (Q1276219) (← links)
- On lines missing polyhedral sets in 3-space (Q1334933) (← links)
- Monte Carlo approximation of form factors with error bounded a priori (Q1355196) (← links)
- On computing the diameter of a point set in high dimensional Euclidean space. (Q1853493) (← links)
- Ray shooting on triangles in 3-space (Q2366231) (← links)
- Lower bounds on stabbing lines in 3-space (Q2367128) (← links)
- (Q2768279) (← links)
- On point location and motion planning among simplices (Q2817600) (← links)
- Counting Circular Arc Intersections (Q3137708) (← links)
- (Q3138935) (← links)
- Electrostatic fields without singularities (Q3158525) (← links)
- (Q4037404) (← links)
- (Q4252353) (← links)
- On Collision-Free Placements of Simplices and the Closest Pair of Lines in 3-Space (Q4286233) (← links)
- (Q4401022) (← links)
- On Point Location and Motion Planning among Simplices (Q4714558) (← links)
- (Q4875183) (← links)
- Repetitive Hidden Surface Removal for Polyhedra (Q4895798) (← links)
- Repetitive hidden-surface-removal for polyhedral scenes (Q5060145) (← links)
- Efficient IP table lookup via adaptive stratified trees with selective reconstructions (Q5269269) (← links)
- Theoretical Computer Science (Q5395072) (← links)
- Algorithms – ESA 2004 (Q5464634) (← links)
