Length of the Longest Increasing Path

Given n distinct 2D points and an index k, find the maximum length of a strictly increasing sequence by both x and y that contains coordinates[k]. This is a 2D Longest Increasing Subsequence-style problem (n up to 1e5) where you must combine the longest increasing chain ending at k and the longest increasing chain starting at k.