Filter your results
- 119
- 11
- 47
- 43
- 29
- 3
- 2
- 2
- 1
- 1
- 1
- 1
- 25
- 130
- 1
- 2
- 1
- 3
- 2
- 3
- 2
- 5
- 3
- 3
- 9
- 1
- 3
- 10
- 7
- 9
- 13
- 6
- 10
- 7
- 5
- 6
- 2
- 7
- 2
- 2
- 1
- 4
- 2
- 126
- 4
- 123
- 89
- 44
- 34
- 18
- 15
- 14
- 11
- 9
- 8
- 8
- 7
- 6
- 6
- 5
- 5
- 4
- 4
- 4
- 3
- 3
- 3
- 3
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 130
- 35
- 30
- 21
- 20
- 19
- 14
- 13
- 11
- 10
- 10
- 9
- 9
- 9
- 9
- 8
- 7
- 7
- 7
- 6
- 6
- 6
- 6
- 6
- 5
- 5
- 5
- 4
- 4
- 4
- 4
- 4
- 4
- 4
- 4
- 4
- 4
- 3
- 3
- 3
- 3
- 3
- 3
- 3
- 3
- 3
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
130 Results
|
The Number of Lines Tangent to Arbitrary Convex Polyhedra in 3DProceedings of the 20th Annual Symposium on Computational Geometry, Jun 2004, Brooklyn, NY, United States. pp.46 - 55, ⟨10.1145/997817.997827⟩
Conference papers
inria-00103995v1
|
||
|
Intersecting Quadrics: An Efficient and Exact ImplementationSymposium on Computational Geometry - SoCG'2004, Jun 2004, Brooklyn, NY, United States. pp.419 - 428, ⟨10.1145/997817.997880⟩
Conference papers
inria-00104003v1
|
||
|
On the Computation of the 3D Visibility Skeleton16th Annual International Computing and Combinatorics Conference - COCOON 2010, Jul 2010, Nha Trang, Vietnam
Conference papers
inria-00472839v1
|
||
|
The Voronoi Diagram of Three Lines23rd 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⟩
Conference papers
inria-00186085v1
|
||
|
Drawing $K_n$ in Three Dimensions with One Bend per Edge[Research Report] RR-5708, INRIA. 2005
Reports
inria-00071219v1
|
||
|
The expected number of 3D visibility events is linear[Research Report] RR-4671, INRIA. 2002
Reports
inria-00071914v1
|
||
|
An Upper Bound on the Average Size of SilhouettesDiscrete and Computational Geometry, 2008, 40 (2), pp.241-257. ⟨10.1007/s00454-008-9089-3⟩
Journal articles
inria-00336571v1
|
||
|
Universal Sets of n Points for One-bend Drawings of Planar Graphs with n VerticesDiscrete and Computational Geometry, 2010, 43 (2), pp.272-288. ⟨10.1007/s00454-009-9149-3⟩
Journal articles
inria-00431769v1
|
||
Motion planning of legged robotsWorkshop on Algorithmic foundations of robotics, 1994, San Francisco?, United States
Conference papers
hal-01179461v1
|
|||
|
Analysis of Farthest Point Sampling for Approximating Geodesics in a GraphComputational Geometry, 2016, 57, pp.1-7. ⟨10.1016/j.comgeo.2016.05.005⟩
Journal articles
hal-01297624v2
|
||
|
Bivariate Triangular Decompositions in the Presence of Asymptotes[Research Report] INRIA. 2015
Reports
hal-01200802v1
|
||
|
On Point-sets that Support Planar GraphsComputational Geometry, 2013, 43 (1), pp.29--50. ⟨10.1016/j.comgeo.2012.03.003⟩
Journal articles
hal-00684510v1
|
||
|
Rational Univariate Representations of Bivariate Systems and Applications[Research Report] RR-8262, INRIA. 2013, pp.26
Reports
hal-00802698v2
|
||
|
Improved algorithm for computing separating linear forms for bivariate systemsISSAC - 39th International Symposium on Symbolic and Algebraic Computation, Jul 2014, Kobe, Japan
Conference papers
hal-00992634v1
|
||
|
On the Edge-length Ratio of Outerplanar Graphs International Symposium on Graph Drawing and Network Visualization, 2017, Boston, United States
Conference papers
hal-01591699v1
|
||
|
Curvature-Constrained Shortest Paths in a Convex PolygonSIAM Journal on Computing, 2002, 31 (6), pp.1814-1851. ⟨10.1137/S0097539700374550⟩
Journal articles
inria-00100887v1
|
||
|
Near-Optimal Parameterization of the Intersection of Quadrics: IV. An Efficient and Exact Implementation[Research Report] RR-5670, INRIA. 2005, pp.30
Reports
inria-00070341v1
|
||
|
Orientation des pièces artistiques pour le procédé de Stratoconception10th European Forum on Rapid Prototyping, Sep 2004, Paris, France
Conference papers
inria-00104000v1
|
||
|
Transversals to line segments in three-dimensional spaceDiscrete and Computational Geometry, 2005, 34 (3), pp.381 - 390. ⟨10.1007/s00454-005-1183-1⟩
Journal articles
inria-00000384v1
|
||
|
An Experimental Assessment of the 2D Visibility Complex17th Canadian Conference on Computational Geometry - CCCG'2005, Aug 2005, Windsor, Canada
Conference papers
inria-00000373v2
|
||
|
On the Complexity of Sets of Free Lines and Line Segments Among Balls in Three DimensionsDiscrete and Computational Geometry, 2012, 47 (4), pp.756-772. ⟨10.1007/s00454-012-9414-8⟩
Journal articles
hal-00643880v1
|
||
|
On the Complexity of Umbra and PenumbraComputational Geometry, 2009, 42 (8), pp.758--771. ⟨10.1016/j.comgeo.2008.04.007⟩
Journal articles
inria-00431418v1
|
||
|
Near-Optimal Parameterization of the Intersection of Quadrics: I. The Generic AlgorithmJournal of Symbolic Computation, 2008, 43 (3), pp.168--191. ⟨10.1016/j.jsc.2007.10.006⟩
Journal articles
inria-00186089v1
|
||
|
On the Expected Size of the 2D Visibility ComplexInternational Journal of Computational Geometry and Applications, 2007, 17 (4), pp.361-381. ⟨10.1142/S0218195907002380⟩
Journal articles
inria-00103926v1
|
||
|
On the number of line tangents to four triangles in three-dimensional space16th Canadian Conference on Computational Geometry - CCCG'04, 2004, Montreal, Canada, 4 p
Conference papers
inria-00099873v1
|
||
|
Interpolation problem with curvature constraintsA. Cohen, C. Rabut & L. L. Schumaker. Curve & Surface Fitting, Vanderbilt University press, 2000
Book sections
inria-00099245v1
|
||
Certificated and Efficient Solver for Intersection of three quadric surfaces[Internship report] A00-R-393 || pandey00a, 2000
Reports
inria-00099246v1
|
|||
|
New bivariate system solver and topology of algebraic curves27th European Workshop on Computational Geometry - EuroCG 2011, Mar 2011, Morschach, Switzerland
Conference papers
inria-00580431v1
|
||
|
On the Number of Lines Tangent to Four Convex Polyhedra14th Canadian Conference on Computational Geometry - CCCG'02, 2002, Lethbridge, Canada
Conference papers
inria-00099449v1
|
||
|
Transversals to Line Segments in R315th Canadian Conference on Computational Geometry - CCCG'2003, 2003, Halifax, Canada, 4 p
Conference papers
inria-00099479v1
|