|
||
---|---|---|
inria-00077116v1
Reports
Maintaining Visibility Information of Planar Point Sets with a Moving Viewpoint [Research Report] RR-5742, INRIA. 2005, pp.11 |
||
inria-00100553v1
Book sections
Even Pairs Jorge L. Ramirez Alfonsin et Bruce A. Reed. Perfect Graphs, John Wiley and Sons Ltd., 23 p, 2001, Wiley-Interscience Series in Discrete Mathematics and Optimization |
||
inria-00186085v1
Conference papers
The Voronoi Diagram of Three Lines 23rd Annual Symposium on Computational Geometry (SoCG'07), Hee-Kap Ahn, Otfried Cheong, and Kyung-Yong Chwa, Jun 2007, Gyeongju, South Korea. pp.255-264, ⟨10.1145/1247069.1247116⟩ |
||
inria-00099449v1
Conference papers
On the Number of Lines Tangent to Four Convex Polyhedra 14th Canadian Conference on Computational Geometry - CCCG'02, 2002, Lethbridge, Canada |
||
inria-00100577v1
Conference papers
Bull-Reducible Berge Graphs are Perfect Euroconference on Combinatorics, Graph Theory and Applications - COMB'01, 2001, Barcelone, Spain, 3 p |
||
inria-00000373v2
Conference papers
An Experimental Assessment of the 2D Visibility Complex 17th Canadian Conference on Computational Geometry - CCCG'2005, Aug 2005, Windsor, Canada |
||
inria-00000374v1
Conference papers
Drawing $K_n$ in Three Dimensions with One Bend per Edge 13th International Symposium on Graph Drawing - GD'2005, Sep 2005, University of Limerick, Ireland |
||
inria-00103916v1
Journal articles
Lines and free line segments Tangent to Arbitrary Three-dimensional Convex Polyhedra SIAM Journal on Computing, Society for Industrial and Applied Mathematics, 2007, 37 (2), pp.522-551. ⟨10.1137/S0097539705447116⟩ |
||
inria-00099810v1
Journal articles
The expected number of 3D visibility events is linear SIAM Journal on Computing, Society for Industrial and Applied Mathematics, 2003, 32 (6), pp.1586-1620. ⟨10.1137/S0097539702419662⟩ |
||
inria-00070203v1
Reports
On the Expected Size of the 2D Visibility Complex [Research Report] RR-5822, INRIA. 2006, pp.17 |
||
|
||
inria-00071914v1
Reports
The expected number of 3D visibility events is linear [Research Report] RR-4671, INRIA. 2002 |
||
inria-00099245v1
Book sections
Interpolation problem with curvature constraints A. Cohen, C. Rabut & L. L. Schumaker. Curve & Surface Fitting, Vanderbilt University press, 2000 |
||
inria-00099260v1
Reports
Distance segment visibility graphs [Intern report] A00-R-429 || everett00b, 2000 |
||
inria-00072572v1
Reports
Interpolation with Curvature Constraints [Research Report] RR-4064, INRIA. 2000 |
||
inria-00186262v2
Reports
On the Complexity of Umbra and Penumbra [Research Report] RR-6347, INRIA. 2007, pp.28 |
||
inria-00071226v1
Reports
On the Number of Maximal Free Line Segments Tangent to Arbitrary Three-dimensional Convex Polyhedra [Research Report] RR-5671, INRIA. 2005 |
||
inria-00071219v1
Reports
Drawing $K_n$ in Three Dimensions with One Bend per Edge [Research Report] RR-5708, INRIA. 2005 |
||
inria-00187253v1
Conference papers
Between umbra and penumbra Proceedings of the 23rd Annual Symposium on Computational Geometry, Hee-Kap Ahn, Otfried Cheong, and Kyung-Yong Chwa, Jun 2007, Gyeongju, South Korea. pp.265-274, ⟨10.1145/1247069.1247117⟩ |
||
inria-00189036v1
Conference papers
Universal Sets of n Points for 1-bend Drawings of Planar Graphs with n Vertices The 15th International Symposium on Graph Drawing - GD 2007, Sep 2007, Sydney, Australia. pp.345-351, ⟨10.1007/978-3-540-77537-9_34⟩ |
||
inria-00189038v1
Conference papers
Farthest-Polygon Voronoi Diagrams 15th Annual European Symposium on Algorithms - ALGO 2007, Oct 2007, Eilat, Israel. pp.407-418, ⟨10.1007/978-3-540-75520-3_37⟩ |
||
inria-00336502v1
Conference papers
On the Size of the 3D Visibility Skeleton: Experimental Results 16th Annual European Symposium on Algorithms - ESA 2008, Sep 2008, Karlsruhe, Germany. pp.805--816, ⟨10.1007/978-3-540-87744-8_67⟩ |
||
inria-00338095v1
Conference papers
Towards an Implementation of the 3D Visibility Skeleton 23rd Annual Symposium on Computational Geometry, Jun 2007, Gyeongju, South Korea. pp.131 - 132, ⟨10.1145/1247069.1247094⟩ |
||
inria-00442788v1
Conference papers
Convexifying Star-Shaped Polygons 10th Canadian Conference on Computational Geometry (CCCG'98), 1998, Montreal, Canada. pp.10-12 |
||
inria-00108058v1
Conference papers
Hierarchical Vertical Decompositions, Ray Shooting, and Circular Arc Queries in Simple Polygons ACM Symposium on Computational Geometry, Association for Computing Machinery, 1999, Miami Beach, Florida, USA, pp.227-236 |
||
inria-00103952v1
Conference papers
Throwing stones in simple polygons 2nd International Conference on Algorithmic Aspects in Information and Management (AAIM'06), Jun 2006, Hong Kong, China, pp.185-193, ⟨10.1007/11775096_18⟩ ![]() |
||
inria-00103945v1
Conference papers
Predicates for Line Transversals in 3D 18th Canadian Conference on Computational Geometry - CCCG 2006, Aug 2006, Kingston, Canada |
||
inria-00103995v1
Conference papers
The Number of Lines Tangent to Arbitrary Convex Polyhedra in 3D Proceedings of the 20th Annual Symposium on Computational Geometry, Jun 2004, Brooklyn, NY, United States. pp.46 - 55, ⟨10.1145/997817.997827⟩ |
||
inria-00103923v1
Journal articles
Drawing Kn in Three Dimensions with One Bend per Edge Journal of Graph Algorithms and Applications, Brown University, 2006, 10 (2), pp.287-295 |
||
inria-00431769v1
Journal articles
Universal Sets of n Points for One-bend Drawings of Planar Graphs with n Vertices Discrete and Computational Geometry, Springer Verlag, 2010, 43 (2), pp.272-288. ⟨10.1007/s00454-009-9149-3⟩ |
||
|