The following pages link to Rodrigo I. Silveira (Q396474):
Displayed 50 items.
- Computing a visibility polygon using few variables (Q396475) (← links)
- Removing local extrema from imprecise terrains (Q419504) (← links)
- New results on stabbing segments with a polygon (Q474818) (← links)
- Balanced partitions of 3-colored geometric sets in the plane (Q479011) (← links)
- Space-time trade-offs for stack-based algorithms (Q494797) (← links)
- Production matrices for geometric graphs (Q510608) (← links)
- Peeling meshed potatoes (Q534778) (← links)
- On the number of higher order Delaunay triangulations (Q551184) (← links)
- Towards a definition of higher order constrained Delaunay triangulations (Q1005329) (← links)
- Optimal higher order Delaunay triangulations of polygons (Q1028236) (← links)
- Planar bichromatic minimum spanning trees (Q1044035) (← links)
- On the complexity of barrier resilience for fat regions and bounded ply (Q1615674) (← links)
- Characteristic polynomials of production matrices for geometric graphs (Q1689984) (← links)
- Colored spanning graphs for set visualization (Q1699297) (← links)
- Colored ray configurations (Q1699300) (← links)
- Stabbing segments with rectilinear objects (Q1738129) (← links)
- New results on production matrices for geometric graphs (Q1792103) (← links)
- On the complexity of barrier resilience for fat regions (Q1796437) (← links)
- Computing optimal shortcuts for networks (Q2001454) (← links)
- Affine invariant triangulations (Q2065637) (← links)
- Flips in higher order Delaunay triangulations (Q2081619) (← links)
- Farthest color Voronoi diagrams: complexity and algorithms (Q2081623) (← links)
- On approximating shortest paths in weighted triangular tessellations (Q2154121) (← links)
- Bichromatic 2-center of pairs of points (Q2261579) (← links)
- Optimization for first order Delaunay triangulations (Q2269140) (← links)
- A new lower bound on the maximum number of plane graphs using production matrices (Q2331222) (← links)
- Geometric biplane graphs. I: Maximal graphs (Q2345511) (← links)
- Geometric biplane graphs. II: Graph augmentation (Q2345512) (← links)
- Median trajectories (Q2375955) (← links)
- Region-based approximation of probability distributions (for visibility between imprecise points among obstacles) (Q2415360) (← links)
- Matching points with disks with a common intersection (Q2421852) (← links)
- Drawing (complete) binary tanglegrams (Q2428677) (← links)
- New production matrices for geometric graphs (Q2666914) (← links)
- Colored Spanning Graphs for Set Visualization (Q2867665) (← links)
- Terrain Visibility with Multiple Viewpoints (Q2872096) (← links)
- Bichromatic 2-Center of Pairs of Points (Q2894450) (← links)
- (Q2957891) (← links)
- Flow computations on imprecise terrains (Q2968096) (← links)
- Adjacency-preserving spatial treemaps (Q2970446) (← links)
- Finding the Most Relevant Fragments in Networks (Q3075611) (← links)
- Computing the Visibility Polygon Using Few Variables (Q3104601) (← links)
- Connect the Dot: Computing Feed-Links with Minimum Dilation (Q3183440) (← links)
- On the Number of Higher Order Delaunay Triangulations (Q3563004) (← links)
- FLOODING COUNTRIES AND DESTROYING DAMS (Q3575390) (← links)
- Median Trajectories (Q3586486) (← links)
- Smoothing Imprecise 1.5D Terrains (Q3602841) (← links)
- Optimization for First Order Delaunay Triangulations (Q3603525) (← links)
- Flooding Countries and Destroying Dams (Q3603529) (← links)
- Drawing (Complete) Binary Tanglegrams (Q3611867) (← links)
- A Note on Flips in Diagonal Rectangulations (Q4560267) (← links)