Pages that link to "Item:Q2397099"
From MaRDI portal
The following pages link to Cutting algebraic curves into pseudo-segments and applications (Q2397099):
Displaying 22 items.
- Point-curve incidences in the complex plane (Q722326) (← links)
- Incidences with curves in \(\mathbb{R}^d\) (Q727188) (← links)
- Distinct distances with \(\ell_p\) metrics (Q824324) (← links)
- Nöther-type theorem of piecewise algebraic curves on quasi-cross-cut partition (Q1041516) (← links)
- How to cut pseudoparabolas into segments (Q1380780) (← links)
- Almost tight bounds for eliminating depth cycles in three dimensions (Q1745206) (← links)
- Cutting circles into pseudo-segments and improved bounds for incidences (Q1864110) (← links)
- Triangle areas in line arrangements (Q2005689) (← links)
- A general incidence bound in \(\mathbb{R}^d\) (Q2033938) (← links)
- Planar point sets determine many pairwise crossing segments (Q2039541) (← links)
- Removing depth-order cycles among triangles: an algorithm generating triangular fragments (Q2225657) (← links)
- Corner cutting evaluation algorithms for general rational curves (Q2341008) (← links)
- Crossings between non-homotopic edges (Q2673492) (← links)
- Distinct distances on non-ruled surfaces and between circles (Q2690125) (← links)
- Algebraic cuts (Q4383046) (← links)
- Efficient Algorithm for Generalized Polynomial Partitioning and Its Applications (Q4989918) (← links)
- Distinct Distances Between a Circle and a Generic Set (Q4991650) (← links)
- Counting higher order tangencies for plane curves (Q4993094) (← links)
- Counting and Cutting Rich Lenses in Arrangements of Circles (Q5071100) (← links)
- (Q5088930) (← links)
- Constructive Polynomial Partitioning for Algebraic Curves in $\mathbb{R}^3$ with Applications (Q5138781) (← links)
- Representation Complexities of SemiAlgebraic Graphs (Q5237912) (← links)
